Sciweavers

189 search results - page 12 / 38
» Scheduling Issues in Optimistic Parallelization
Sort
View
EUROPAR
2000
Springer
15 years 1 months ago
Scheduling Queries for Tape-Resident Data
Tertiary storage systems are used when secondary storage can not satisfy the data storage requirements and/or it is a more cost effective option. The new application domains requir...
Sachin More, Alok N. Choudhary
FAST
2011
14 years 1 months ago
A Scheduling Framework That Makes Any Disk Schedulers Non-Work-Conserving Solely Based on Request Characteristics
Exploiting spatial locality is critical for a disk scheduler to achieve high throughput. Because of the high cost of disk head seeks and the non-preemptible nature of request serv...
Yuehai Xu, Song Jiang
HPDC
2006
IEEE
15 years 3 months ago
Adaptive I/O Scheduling for Distributed Multi-applications Environments
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
Adrien Lebre, Yves Denneulin, Guillaume Huard, Prz...
HPDC
2006
IEEE
15 years 3 months ago
On the Harmfulness of Redundant Batch Requests
Most parallel computing resources are controlled by batch schedulers that place requests for computation in a queue until access to compute nodes is granted. Queue waiting times a...
Henri Casanova
94
Voted
IJPP
2000
94views more  IJPP 2000»
14 years 9 months ago
Path Analysis and Renaming for Predicated Instruction Scheduling
Increases in instruction level parallelism are needed to exploit the potential parallelism available in future wide issue architectures. Predicated execution is an architectural m...
Lori Carter, Beth Simon, Brad Calder, Larry Carter...