Sciweavers

129 search results - page 20 / 26
» Simulation run length planning
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
GRID
2004
Springer
14 years 1 months ago
MARS: A Metascheduler for Distributed Resources in Campus Grids
Computational grids are increasingly being deployed in campus environments to provide unified access to distributed and heterogeneous resources such as clusters, storage arrays, ...
Abhijit Bose, Brian Wickman, Cameron Wood
IPPS
2000
IEEE
14 years 11 hour ago
A Mechanism for Speculative Memory Accesses Following Synchronizing Operations
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
Takayuki Sato, Kazuhiko Ohno, Hiroshi Nakashima
BIRTHDAY
1994
Springer
13 years 11 months ago
Generalizing Cook's Transformation to Imperative Stack Programs
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
Nils Andersen, Neil D. Jones
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
13 years 11 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman