Name
Abstract | ||
|---|---|---|
In this paper we present a scalable, distributed architecture that allocates idle CPUs for task execution, where any node may request the execution of a group of tasks by other ones. A fast, scalable discovery protocol is an essential component. Also, up to date information about free nodes is efficiently managed in each node by an availability protocol. Both protocols exploit a tree-based peer-to-peer network that adds fault-tolerant capabilities. Results from experiments and simulation tests, using a simple allocation method, show discovery and allocation costs scaling logarithmically with the number of nodes, even with low communication overhead and little, bounded state in each node. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11847366_25 | HPCC |
Keywords | Field | DocType |
scalable architecture,task execution,allocation cost,fault-tolerant capability,availability protocol,free node,bounded state,simple allocation method,show discovery,essential component,p2p network,idle cpus,scalable discovery protocol,bound states,network protocol,distributed architecture,fault tolerant,grid computing | Scalable architecture,Grid computing,Peer-to-peer,Idle,Computer science,Real-time computing,Exploit,Fault tolerance,Scalability,Bounded function,Distributed computing | Conference |
Volume | ISSN | ISBN |
4208 | 0302-9743 | 3-540-39368-4 |
Citations | PageRank | References |
5 | 0.43 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Javier Celaya | 1 | 36 | 3.03 |
| Unai Arronategui | 2 | 35 | 6.92 |