Sciweavers

3148 search results - page 440 / 630
» On the Dynamic Initialization of Parallel Computers
Sort
View
SPAA
1997
ACM
15 years 6 months ago
System Area Network Mapping
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
Brent N. Chun, Alan M. Mainwaring, Saul Schleimer,...
SPAA
1994
ACM
15 years 6 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
DCOSS
2006
Springer
15 years 5 months ago
Y-Threads: Supporting Concurrency in Wireless Sensor Networks
Abstract. Resource constrained systems often are programmed using an eventbased model. Many applications do not lend themselves well to an event-based approach, but preemptive mult...
Christopher Nitta, Raju Pandey, Yann Ramin
CCGRID
2009
IEEE
15 years 3 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
112
Voted
CONCUR
2010
Springer
15 years 3 months ago
A Theory of Design-by-Contract for Distributed Multiparty Interactions
Reliability is a critical issue in many multi-organizational distributed applications, be they web services, financial protocols, scientific computing infrastructure, and software ...
Laura Bocchi, Kohei Honda, Emilio Tuosto, Nobuko Y...