Sciweavers

1205 search results - page 146 / 241
» On P Systems with Bounded Parallelism
Sort
View
SIROCCO
2010
13 years 11 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...
MIDDLEWARE
2009
Springer
14 years 4 months ago
Rhizoma: A Runtime for Self-deploying, Self-managing Overlays
Abstract. The trend towards cloud and utility computing infrastructures raises challenges not only for application development, but also for management: diverse resources, changing...
Qin Yin, Adrian Schüpbach, Justin Cappos, And...
IPPS
2006
IEEE
14 years 4 months ago
D1HT: a distributed one hop hash table
Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in o...
Luiz Rodolpho Monnerat, Cláudio L. Amorim
EDO
2006
Springer
14 years 1 months ago
Damon: a decentralized aspect middleware built on top of a peer-to-peer overlay network
In this paper we present Damon, a decentralized wide-area runtime aspect middleware built on top of a structured peer-topeer (p2p) substrate and a dynamic Aspect Oriented Programm...
Rubén Mondéjar, Pedro García ...
GRID
2006
Springer
13 years 10 months ago
Applying Peer-to-Peer Techniques to Grid Replica Location Services
Peer-to-peer systems offer attractive system management properties, including the ability of components that join the network to self-organize; scalability up to tens of thousands...
Ann L. Chervenak, Min Cai