2924 search results - page 2 / 585 » Lower Bounds in Distributed Computing |
171
Voted
SPDP
1991
IEEE
15 years 10 months ago
1991
IEEE
204
Voted
IPPS
1998
IEEE
15 years 11 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 ...
164
Voted
SPDP
1990
IEEE
15 years 11 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...
249
Voted
ISPAN
2002
IEEE
16 years 6 days 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...