Sciweavers

2432 search results - page 194 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
JAC
2008
15 years 7 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
161
Voted
IPPS
2009
IEEE
16 years 24 days ago
Sparse collective operations for MPI
Abstract—We discuss issues in designing sparse (nearest neighbor) collective operations for communication and reduction operations in small neighborhoods for the Message Passing ...
Torsten Hoefler, Jesper Larsson Träff
146
Voted
PODC
1995
ACM
15 years 9 months ago
A Framework for Protocol Composition in Horus
The Horus system supports a communication architecture ats protocols as instances of an abstract data type. This approach encourages developers to partition complex protocols into...
Robbert van Renesse, Kenneth P. Birman, Roy Friedm...
165
Voted
EDO
2005
Springer
15 years 11 months ago
A middleware-independent model and language for component distribution
A distribution model for the new generation of component languages, which allows to plug required into provided interfaces, is presented together with the distributed component la...
Hans Albrecht Schmid, Marco Pfeifer, Thorsten Schn...
FIDJI
2004
Springer
15 years 11 months ago
An MDA-Based Approach for Inferring Concurrency in Distributed Systems
Abstract. When dealing with distributed systems, one of the most important problems that has to be addressed is concurrency. Distributed systems are inherently concurrent, distribu...
Raul Silaghi, Alfred Strohmeier