Sciweavers

1519 search results - page 136 / 304
» Network Partitioning of Data Parallel Computations
Sort
View
EUROPAR
2000
Springer
14 years 28 days ago
A Combinatorial Characterization of Properties Preserved by Antitokens
Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distr...
Costas Busch, Neophytos Demetriou, Maurice Herlihy...
SPAA
1993
ACM
14 years 1 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
MIDDLEWARE
2010
Springer
13 years 7 months ago
Adapting Distributed Real-Time and Embedded Pub/Sub Middleware for Cloud Computing Environments
Enterprise distributed real-time and embedded (DRE) publish/subscribe (pub/sub) systems manage resources and data that are vital to users. Cloud computing—where computing resourc...
Joe Hoffert, Douglas C. Schmidt, Aniruddha S. Gokh...
CCGRID
2005
IEEE
14 years 2 months ago
Data grid performance analysis through study of replication and storage infrastructure parameters
Running Data Grid applications such as High Energy Nuclear Physics (HENP) and weather modelling experiments involves working with huge data sets possibly of hundreds of Terabytes ...
Ernest Sithole, Gerard P. Parr, Sally I. McClean
ISHPC
1997
Springer
14 years 1 months ago
Implementing Iterative Solvers for Irregular Sparse Matrix Problems in High Performance Fortran
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
Eric de Sturler, Damian Loher