More et al. - Google Patents

E ciently sequencing tape-resident jobs

More et al.

Document ID: 8950374093828197865
Author: More S; Muthukrishnan S; Shriver E
Publication venue: Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, Pennsylvania

External Links

Cited by

Snippet

Data repositories are terabytes or petabytes in size, and are expected to continue to grow. Consequently, many applications comprise of tape-resident jobs, namely, ones that process data resident on tape. Not all orders of execution amongst tape-resident jobs make optimum …

Continue reading at citeseerx.ist.psu.edu (PDF) (other versions)

238000000034 method 0 abstract description 10

Classifications

- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/52—Programme synchronisation; Mutual exclusion, e.g. by means of semaphores; Contention for resources among tasks
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99951—File or database maintenance
- Y10S707/99952—Coherency, e.g. same view to multiple users
- Y10S707/99953—Recoverability
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication	Publication Date	Title
Kedem et al.	1990	Efficient robust parallel computations
Fujimoto	1989	Time Warp on a Shared Memory Multiprocessor.
Dean et al.	2008	MapReduce: simplified data processing on large clusters
Lin et al.	2012	Apriori-based frequent itemset mining algorithms on MapReduce
EP2212806B1 (en)	2012-06-27	Allocation of resources for concurrent query execution via adaptive segmentation
US9244928B1 (en)	2016-01-26	Systems and methods for directory snapshot
US8352424B2 (en)	2013-01-08	System and method for managing replicas of objects in a distributed storage system
EP3062227B1 (en)	2017-10-04	Scalable grid deduplication
US20120110047A1 (en)	2012-05-03	Reducing the Response Time of Flexible Highly Data Parallel Tasks
US6591287B1 (en)	2003-07-08	Method to increase the efficiency of job sequencing from sequential storage
Kaya et al.	2007	Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
Han et al.	2018	Checkpointing workflows for fail-stop errors
WO2011100366A2 (en)	2011-08-18	System and method for managing replicas of objects in a distributed storage system
Raaijmakers et al.	2020	Achievable stability in redundancy systems
Tsitsiklis et al.	1986	The performance of a precedence-based queuing discipline
Kosar	2006	A new paradigm in data intensive computing: Stork and the data-aware schedulers
More et al.	1999	Efficiently sequencing tape-resident jobs
More et al.	0	E ciently sequencing tape-resident jobs
Gu et al.	2008	Exploring data parallelism and locality in wide area networks
Mezher et al.	2002	Parallel computation of pseudospectra of large sparse matrices
Goda et al.	2002	Run-time load balancing system on san-connected PC cluster for dynamic injection of CPU and disk resource—A case study of data mining application—
Buczkowski	2015	Using MySQL for load balancing and job control under slurm
WO2021061183A1 (en)	2021-04-01	Shuffle reduce tasks to reduce i/o overhead
Luo et al.	2018	Towards efficiently supporting database as a service with QoS guarantees
Goumopoulos et al.	1998	Parallel algorithms for airline crew planning on networks of workstations