Database Paper Browser

Back to papers

Efficiently sequencing tape-resident jobs

Summary: Reduce sequencing of tape-resident jobs to a flow-shop formulation, enabling algorithmic scheduling tailored to tape-access constraints. Evaluation on EOSDIS and synthetic traces yields up to 15% batch runtime reduction, showing practical impact for large tape repositories. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1159
Venue
PODS
Year
1999
Pagerank
5.1725247e-05
Overall Rank
12,713 | 11.65%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2,994 Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources 1997 VLDB 7.9305372e-05
3,698 Query Processing in Tertiary Memory Databases 1995 VLDB 7.2563328e-05
Previous Page 1 / 1 Next

Semantically Similar Papers