Sciweavers

1205 search results - page 111 / 241
» On P Systems with Bounded Parallelism
Sort
View
114
Voted
IPPS
2003
IEEE
15 years 9 months ago
Transparent Query Caching in Peer-to-Peer Overlay Networks
Peer-to-peer (p2p) systems such as Gnutella and KaZaa are routinely used by millions of people for sharing music and many other files over the Internet, and they account for a si...
Sunil Patro, Y. Charlie Hu
122
Voted
WOSP
2004
ACM
15 years 9 months ago
Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models
This paper describes how soft performance bounds can be expressed for software systems using stochastic probes over stochastic process algebra models. These stochastic probes are ...
Ashok Argent-Katwala, Jeremy T. Bradley, Nicholas ...
GD
2009
Springer
15 years 1 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
COSPS
2001
Springer
15 years 8 months ago
The Sisal Project: Real World Functional Programming
Programming massively-parallel machine is a daunting task for any human programmer and parallelization may even be impossible for any compiler. Instead, the functional programming ...
Jean-Luc Gaudiot, Thomas DeBoni, John Feo, A. P. W...
HIPEAC
2011
Springer
14 years 3 months ago
A workload-aware mapping approach for data-parallel programs
Much compiler-orientated work in the area of mapping parallel programs to parallel architectures has ignored the issue of external workload. Given that the majority of platforms w...
Dominik Grewe, Zheng Wang, Michael F. P. O'Boyle