Sciweavers

488 search results - page 65 / 98
» Using shared arrays in message-driven parallel programs
Sort
View
PPOPP
2012
ACM
12 years 4 months ago
Synchronization views for event-loop actors
The actor model has already proven itself as an interesting concurrency model that avoids issues such as deadlocks and race conditions by construction, and thus facilitates concur...
Joeri De Koster, Stefan Marr, Theo D'Hondt
JAVA
2001
Springer
14 years 1 months ago
Implementation of a portable software DSM in Java
Rapid commoditization of advanced hardware and progress of networking technology is now making wide area high-performance computing a.k.a. the ‘Grid’ Computing a reality. Sinc...
Yukihiko Sohda, Hidemoto Nakada, Satoshi Matsuoka
HPDC
2005
IEEE
14 years 2 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant
USENIX
2001
13 years 10 months ago
User-Level Checkpointing for LinuxThreads Programs
Multiple threads running in a single, shared address space is a simple model for writing parallel programs for symmetric multiprocessor (SMP) machines and for overlapping I/O and ...
William R. Dieter, James E. Lumpp Jr.
SC
2000
ACM
14 years 1 months ago
MPICH-GQ: Quality-of-Service for Message Passing Programs
Parallel programmers typically assume that all resources required for a program’s execution are dedicated to that purpose. However, in local and wide area networks, contention f...
Alain J. Roy, Ian T. Foster, William Gropp, Nichol...