1257 search results - page 109 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
125
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— In this paper, we study cross-layer design for rate control in multihop wireless networks. In our previous work, we have developed an optimal cross-layered rate control scheme ...
121
Voted
SAC
2005
ACM
15 years 7 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
104
click to vote
SBACPAD
2003
IEEE
15 years 7 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
104
click to vote
ASPLOS
2000
ACM
15 years 6 months ago
2000
ACM
The high arithmetic rates of media processing applications require architectures with tens to hundreds of functional units, multiple register files, and explicit interconnect betw...