2924 search results - page 2 / 585 » Lower Bounds in Distributed Computing |
SPDP
1991
IEEE
15 years 1 months ago
1991
IEEE
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
SPDP
1990
IEEE
15 years 1 months ago
1990
IEEE
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
108
click to vote
ISPAN
2002
IEEE
15 years 2 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...