Sciweavers

1758 search results - page 169 / 352
» Schedule processes, not VCPUs
Sort
View
HPDC
2005
IEEE
16 years 12 days ago
Cost-based scheduling for data-intensive applications on global grids
We present an algorithm for scheduling distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring and processing da...
Srikumar Venugopal, Rajkumar Buyya
EUROSYS
2007
ACM
16 years 3 months ago
Thread clustering: sharing-aware scheduling on SMP-CMP-SMT multiprocessors
The major chip manufacturers have all introduced chip multiprocessing (CMP) and simultaneous multithreading (SMT) technology into their processing units. As a result, even low-end...
David K. Tam, Reza Azimi, Michael Stumm
152
Voted
IPPS
2000
IEEE
15 years 11 months ago
Gang Scheduling with Memory Considerations
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to...
Anat Batat, Dror G. Feitelson
GRID
2006
Springer
15 years 6 months ago
Resource Allocation in Streaming Environments
This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large comp...
Lu Tian, K. Mani Chandy
DAC
2005
ACM
16 years 7 months ago
Optimal procrastinating voltage scheduling for hard real-time systems
This paper presents an optimal procrastinating voltage scheduling (OP-DVS) for hard real-time systems using stochastic workload information. Algorithms are presented for both sing...
Yan Zhang, Zhijian Lu, John Lach, Kevin Skadron, M...