Sciweavers

1156 search results - page 145 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
IJFCS
2006
63views more  IJFCS 2006»
13 years 9 months ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
Mourad Hakem, Franck Butelle
IPPS
2005
IEEE
14 years 2 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
SIGMOD
2003
ACM
162views Database» more  SIGMOD 2003»
14 years 9 months ago
DBGlobe: a service-oriented P2P system for global computing
The challenge of peer-to-peer computing goes beyond simple file sharing. In the DBGlobe project, we view the multitude of peers carrying data and services as a superdatabase. Our ...
Evaggelia Pitoura, Serge Abiteboul, Dieter Pfoser,...
PPOPP
2010
ACM
14 years 6 months ago
Is transactional programming actually easier?
Chip multi-processors (CMPs) have become ubiquitous, while tools that ease concurrent programming have not. The promise of increased performance for all applications through ever ...
Christopher J. Rossbach, Owen S. Hofmann, Emmett W...
EDBT
2004
ACM
143views Database» more  EDBT 2004»
14 years 9 months ago
OGSA-DQP: A Service for Distributed Querying on the Grid
OGSA-DQP is a distributed query processor exposed to users as an Open Grid Services Architecture (OGSA)-compliant Grid service. This service supports the compilation and evaluation...
M. Nedim Alpdemir, Arijit Mukherjee, Anastasios Go...