42 search results - page 5 / 9 » Selective Buddy Allocation for Scheduling Parallel Jobs on C... |
JSSPP
2004
Springer
14 years 1 months ago
2004
Springer
As we continue to evolve into large-scale parallel systems, many of them employing hundreds of computing engines to take on mission-critical roles, it is crucial to design those s...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
CCGRID
2009
IEEE
14 years 3 months ago
2009
IEEE
Volunteer Computing (VC) projects harness the power of computers owned by volunteers across the Internet to perform hundreds of thousands of independent jobs. In VC projects, the ...
ICS
2005
Tsinghua U.
14 years 2 months ago
2005
Tsinghua U.
Traditionally, scheduling in high-end parallel systems focuses on how to minimize the average job waiting time and on how to maximize the overall system utilization. Despite the d...
ICDCS
2000
IEEE
14 years 28 days ago
2000
IEEE
We develop and examine job migration policies by considering effective usage of global memory in addition to CPU load sharing in distributed systems. When a node is identified fo...