RECORD
Bulk Scheduling with DIANA Scheduler
Distributed, Parallel, and Cluster Computing · Submitted 7 Feb 2006
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Results suggest that considerable performance improvements are to be gained by adopting the DIANA scheduling approach.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Results from and progress on the development of a Data Intensive and Network Aware (DIANA) Scheduling engine, primarily for data intensive sciences such as physics analysis, are described. Scientific analysis tasks can involve thousands of computing, data handling, and network resources and the size of the input and output files and the amount of overall storage space allocated to a user necessarily can have significant bearing on the scheduling of data intensive applications. If the input or output files must be retrieved from a remote location, then the time required transferring the files must also be taken into consideration when scheduling compute resources for the given application. The central problem in this study is the coordinated management of computation and data at multiple locations and not simply data movement. However, this can be a very costly operation and efficient scheduling can be a challenge if compute and data resources are mapped without network cost. We have implemented an adaptive algorithm within the DIANA Scheduler which takes into account data location and size, network performance and computation capability to make efficient global scheduling decisions. DIANA is a performance-aware as well as an economy-guided Meta Scheduler. It iteratively allocates each job to the site that is likely to produce the best performance as well as optimizing the global queue for any remaining pending jobs. Therefore it is equally suitable whether a single job is being submitted or bulk scheduling is being performed. Results suggest that considerable performance improvements are to be gained by adopting the DIANA scheduling approach.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Results from and progress on the development of a Data Intensive and Network Aware (DIANA) Scheduling engine, primarily for data intensive sciences such as physics analysis, are described. | contribution 0.98 | 0.79 | 0.05 | asserted 0.91 |
| s1 | Scientific analysis tasks can involve thousands of computing, data handling, and network resources and the size of the input and output files and the amount of overall storage space allocated to a user necessarily can have significant bearing on the scheduling of data intensive applications. | background 1.00 | 0.08 | 0.02 | hedged possibility 0.80 |
| s2 | If the input or output files must be retrieved from a remote location, then the time required transferring the files must also be taken into consideration when scheduling compute resources for the given application. | background 1.00 | 0.09 | 0.02 | asserted 0.89 |
| s3 | The central problem in this study is the coordinated management of computation and data at multiple locations and not simply data movement. | background 0.88 | 0.24 | 0.06 | asserted 1.00 |
| s4 | However, this can be a very costly operation and efficient scheduling can be a challenge if compute and data resources are mapped without network cost. | background 0.90 | 0.10 | 0.03 | asserted 0.75 |
| s5 | We have implemented an adaptive algorithm within the DIANA Scheduler which takes into account data location and size, network performance and computation capability to make efficient global scheduling decisions. | method 0.61 | 0.93 | 0.10 | asserted 1.00 |
| s6 | DIANA is a performance-aware as well as an economy-guided Meta Scheduler. | contribution 0.71 | 0.57 | 0.05 | asserted 1.00 |
| s7 | It iteratively allocates each job to the site that is likely to produce the best performance as well as optimizing the global queue for any remaining pending jobs. | method 0.97 | 0.71 | 0.07 | asserted 0.83 |
| s8 | Therefore it is equally suitable whether a single job is being submitted or bulk scheduling is being performed. | interpretation 0.55 | 0.54 | 0.07 | asserted 0.97 |
| s9 | Results suggest that considerable performance improvements are to be gained by adopting the DIANA scheduling approach. | result 0.78 | 0.89 | 0.85 | hedged possibility 0.98 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Results from and progress on the development of a Data Intensive and Network Aware (DIANA) Scheduling engine, primarily for data intensive sciences such as physics analysis, are described. Scientific analysis tasks can involve thousands of computing, data handling, and network resources and the size of the input and output files and the amount of overall storage space allocated to a user necessarily can have significant bearing on the scheduling of data intensive applications. If the input or output files must be retrieved from a remote location, then the time required transferring the files must also be taken into consideration when scheduling compute resources for the given application. The central problem in this study is the coordinated management of computation and data at multiple locations and not simply data movement. However, this can be a very costly operation and efficient scheduling can be a challenge if compute and data resources are mapped without network cost. We have implemented an adaptive algorithm within the DIANA Scheduler which takes into account data location and size, network performance and computation capability to make efficient global scheduling decisions. DIANA is a performance-aware as well as an economy-guided Meta Scheduler. It iteratively allocates each job to the site that is likely to produce the best performance as well as optimizing the global queue for any remaining pending jobs. Therefore it is equally suitable whether a single job is being submitted or bulk scheduling is being performed. Results suggest that considerable performance improvements are to be gained by adopting the DIANA scheduling approach.
Human review
How the literature uses it
Papers whose main result relates to this one's
States the same result 1 paper
-
Results indicate that considerable performance improvements can be gained by adopting the DIANA scheduling approach.
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.