Sciweavers

17541 search results - page 3217 / 3509
» Complexity in scalable computing
Sort
View
IEEEPACT
2005
IEEE
16 years 24 days ago
HUNTing the Overlap
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
Costin Iancu, Parry Husbands, Paul Hargrove
NDSS
2005
IEEE
16 years 23 days ago
One-Way Isolation: An Effective Approach for Realizing Safe Execution Environments
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...
Weiqing Sun, Zhenkai Liang, V. N. Venkatakrishnan,...
PODC
2005
ACM
16 years 23 days ago
Stochastic analysis of distributed deadlock scheduling
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
Shigang Chen, Yibei Ling
SAC
2005
ACM
16 years 23 days ago
A hybrid approach for multiresolution modeling of large-scale scientific data
Simulations of complex scientific phenomena involve the execution of massively parallel computer programs. These simulation programs generate large-scale multidimensional data set...
Tina Eliassi-Rad, Terence Critchlow
SPAA
2005
ACM
16 years 23 days ago
Fast construction of overlay networks
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...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
« Prev « First page 3217 / 3509 Last » Next »