Sciweavers

1205 search results - page 48 / 241
» On P Systems with Bounded Parallelism
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Minimum number of wavelengths equals load in a DAG without internal cycle
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
Jean-Claude Bermond, Michel Cosnard
IPPS
2009
IEEE
14 years 2 months ago
The Weak Mutual Exclusion problem
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
Paolo Romano, Luís Rodrigues, Nuno Carvalho
SC
1995
ACM
13 years 11 months ago
Detecting Coarse - Grain Parallelism Using an Interprocedural Parallelizing Compiler
This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates...
Mary W. Hall, Saman P. Amarasinghe, Brian R. Murph...
ICPP
2002
IEEE
14 years 17 days ago
Pattern-Based Parallel Programming
The advantages of pattern-based programming have been well-documented in the sequential literature. However patterns have yet to make their way into mainstream parallel computing,...
Steven Bromling, Steve MacDonald, John Anvik, Jona...
MIDDLEWARE
2004
Springer
14 years 1 months ago
Foreseer: A Novel, Locality-Aware Peer-to-Peer System Architecture for Keyword Searches
Peer-to-peer (P2P) systems are becoming increasingly popular and complex, serving millions of users today. However, the design of current unstructured P2P systems does not take ful...
Hailong Cai, Jun Wang