Sciweavers

1517 search results - page 241 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
124
Voted
ENTCS
2007
115views more  ENTCS 2007»
15 years 3 months ago
Self Management and the Future of Software Design
Most software is fragile: even the slightest error, such as changing a single bit, can make it crash. As software complexity has increased, development techniques have kept pace t...
Peter Van Roy
140
Voted
SIAMSC
2011
140views more  SIAMSC 2011»
14 years 6 months ago
A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calcu
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
Lin Lin, Chao Yang, Jianfeng Lu, Lexing Ying, Wein...
ICDCS
2007
IEEE
15 years 10 months ago
Automated Storage Reclamation Using Temporal Importance Annotations
This work focuses on scenarios that require the storage of large amounts of data. Such systems require the ability to either continuously increase the storage space or reclaim spa...
Surendar Chandra, Ashish Gehani, Xuwen Yu
136
Voted
HPDC
2005
IEEE
15 years 9 months ago
Generosity and gluttony in GEMS: grid enabled molecular simulations
Biomolecular simulations produce more output data than can be managed effectively by traditional computing systems. Researchers need distributed systems that allow the pooling of...
Justin M. Wozniak, Paul Brenner, Douglas Thain, Aa...
111
Voted
ISPAN
2005
IEEE
15 years 9 months ago
Supervised Peer-to-Peer Systems
In this paper we present a general methodology for designing supervised peer-to-peer systems. A supervised peer-to-peer system is a system in which the overlay network is formed b...
Kishore Kothapalli, Christian Scheideler