2924 search results - page 4 / 585 » Lower Bounds in Distributed Computing |
89
Voted
COR
2010
14 years 11 months ago
2010
113
Voted
EUROPAR
1998
Springer
15 years 6 months ago
1998
Springer
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
151
click to vote
ICDCS
1995
IEEE
15 years 5 months ago
1995
IEEE
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
127
click to vote
EUROPAR
2009
Springer
15 years 8 months ago
2009
Springer
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
107
click to vote
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...