2432 search results - page 10 / 487 » Using simple abstraction to reinvent computing for paralleli... |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demonstrates that formal approaches developed...
103
click to vote
EUROPAR
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
PPOPP
1997
ACM
15 years 1 months ago
1997
ACM
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
ISHPC
2003
Springer
15 years 2 months ago
2003
Springer
Instruction issue consumes a large amount of energy in out of order processors, largely in the wakeup logic. Proposed solutions to the problem require prediction or additional hard...
COORDINATION
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. A simple and effective way of coordinating distributed, mobile, and parallel applications is to use a virtual shared memory (VSM), such as a Linda tuple-space. In this p...