674 search results - page 62 / 135 » The computational complexity of the parallel knock-out probl... |
113
click to vote
PODC
2009
ACM
15 years 8 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
111
click to vote
HPDC
2007
IEEE
15 years 7 months ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
123
click to vote
PPOPP
2005
ACM
15 years 7 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
112
click to vote
JSA
2000
15 years 1 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
124
click to vote
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...