Sciweavers

2924 search results - page 4 / 585
» Lower Bounds in Distributed Computing
Sort
View
COR
2010
77views more  COR 2010»
13 years 5 months ago
Lower bounds for the mixed capacitated arc routing problem
Luís Gouveia, Maria Cândida Mour&atil...
EUROPAR
1998
Springer
13 years 11 months ago
A Lower Bound for Dynamic Scheduling of Data Parallel Programs
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...
Fabrício Alves Barbosa da Silva, Luis Migue...
ICDCS
1995
IEEE
13 years 11 months ago
Analysis of Resource Lower Bounds in Real-Time Applications
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...
Raed Alqadi, Parameswaran Ramanathan
EUROPAR
2009
Springer
14 years 2 months ago
A Lower Bound for Oblivious Dimensional Routing
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...
Andre Osterloh
SPAA
2009
ACM
14 years 5 days ago
Brief announcement: a lower bound for depth-restricted work stealing
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...
Jim Sukha