2438 search results - page 33 / 488 » Scheduling problems for parallel and distributed systems |
136
click to vote
PDPTA
2004
15 years 5 months ago
2004
Current systems for managing workload on clusters of workstations, particularly those available for Linuxbased (Beowulf) clusters, are typically based on traditional process-based...
123
click to vote
JSSPP
2004
Springer
15 years 9 months ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
115
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
171
Voted
CL
2007
Springer
15 years 3 months ago
2007
Springer
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
147
click to vote
ICDCS
1995
IEEE
15 years 7 months ago
1995
IEEE
One of the mostsoughtaftersoftware innovation of thisdecade is the construction of systems using off-the-shelf workstations that actually deliver, and even surpass, the power and ...