Sciweavers

1205 search results - page 19 / 241
» On P Systems with Bounded Parallelism
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
INFOCOM
2009
IEEE
14 years 2 months ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach
IPPS
2003
IEEE
14 years 24 days ago
Distributed P2P Computing within Triana: A Galaxy Visualization Test Case
We discuss here a parallel implementation of the visualisation of data from a galaxy formation simulation within the Triana problem-solving environment. The visualisation is a tes...
Ian J. Taylor, Matthew S. Shields, Ian Wang, Roger...
GCC
2003
Springer
14 years 22 days ago
P2P Overlay Networks of Constant Degree
This paper proposes an abstract and generic topological model that captures the essence of P2P architecture. Such model should in return facilitate the exploitation of the new desi...
Guihai Chen, Cheng-Zhong Xu, Haiying Shen, Daoxu C...
PERCOM
2004
ACM
14 years 7 months ago
Towards Scalable P2P Computing for Mobile Ad Hoc Networks
In mobile ad hoc networks, nodes interact peer-to-peer. They self-organize, share workloads and provide services that they also use. There are middleware platforms, designed for t...
Marco Conti, Enrico Gregori, Giovanni Turi