5448 search results - page 602 / 1090 » Breakpoints and Time in Distributed Computations |
200
click to vote
PPOPP
1997
ACM
15 years 11 months ago
1997
ACM
Array remappings are useful to many applications on distributed memory parallel machines. They are available in High Performance Fortran, a Fortran-based data-parallel language. T...
224
click to vote
HPDC
1996
IEEE
15 years 11 months ago
1996
IEEE
Load balancing involves assigning to each processor, work proportional to its performance, minimizing the execution time of the program. Althoughstatic load balancing can solve ma...
149
click to vote
JSSPP
1997
Springer
15 years 11 months ago
1997
Springer
It is generally agreed that memory requirements should be taken into account in the scheduling of parallel jobs. However, so far the work on combined processor and memory schedulin...
222
click to vote
CCGRID
2004
IEEE
15 years 10 months ago
2004
IEEE
Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in a P2P resource sharing environment is an efficient searching algorit...
196
click to vote
EDOC
2004
IEEE
2004
IEEE
Security Patterns: A Method for Constructing Secure and Efficient Inter-Company Coordination Systems
15 years 10 months ago
As the Internet, intranets and other wide-area open networks grow, novel techniques for building distributed systems, notably mobile agents, are attracting increasing attention. T...