17541 search results - page 3217 / 3509 » Complexity in scalable computing |
157
click to vote
IEEEPACT
2005
IEEE
15 years 10 months ago
2005
IEEE
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
153
Voted
NDSS
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we present an approach for realizing a safe execution environment (SEE) that enables users to “try out” new software (or configuration changes to existing soft...
130
Voted
PODC
2005
ACM
15 years 10 months ago
2005
ACM
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
167
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
Simulations of complex scientific phenomena involve the execution of massively parallel computer programs. These simulation programs generate large-scale multidimensional data set...
141
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...