Sciweavers

289 search results - page 22 / 58
» Simple COMA Node Implementations
Sort
View
SPAA
2009
ACM
14 years 9 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
ISCA
2005
IEEE
141views Hardware» more  ISCA 2005»
14 years 2 months ago
RegionScout: Exploiting Coarse Grain Sharing in Snoop-Based Coherence
It has been shown that many requests miss in all remote nodes in shared memory multiprocessors. We are motivated by the observation that this behavior extends to much coarser grai...
Andreas Moshovos
COMSWARE
2007
IEEE
14 years 3 months ago
On Optimal Performance in Mobile Ad hoc Networks
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...
Tapas K. Patra, Joy Kuri, Pavan Nuggehalli
HPCA
1999
IEEE
14 years 1 months ago
WildFire: A Scalable Path for SMPs
Researchers have searched for scalable alternatives to the symmetric multiprocessor (SMP) architecture since it was first introduced in 1982. This paper introduces an alternative ...
Erik Hagersten, Michael Koster
EWSN
2006
Springer
14 years 8 months ago
On the Scalability of Routing Integrated Time Synchronization
Time synchronization is a crucial component of a large class of sensor network applications, traditionally implemented as a standalone middleware service that provides a virtual gl...
János Sallai, Branislav Kusy, Ákos L...