Sciweavers

1119 search results - page 100 / 224
» Computing in the Presence of Timing Failures
Sort
View
PPOPP
2003
ACM
14 years 1 months ago
Automated application-level checkpointing of MPI programs
Because of increasing hardware and software complexity, the running time of many computational science applications is now more than the mean-time-to-failure of highpeformance com...
Greg Bronevetsky, Daniel Marques, Keshav Pingali, ...
ATAL
2005
Springer
14 years 1 months ago
Multi-agent decision support via user-modeling
Decision-support requires the gathering and presentation of information, but is subject to many kinds of resource restrictions (e.g. cost, length, time). Individual users differ n...
Terrence Harvey, Keith S. Decker, Sandra Carberry
ASPLOS
2011
ACM
12 years 11 months ago
Mnemosyne: lightweight persistent memory
New storage-class memory (SCM) technologies, such as phasechange memory, STT-RAM, and memristors, promise user-level access to non-volatile storage through regular memory instruct...
Haris Volos, Andres Jaan Tack, Michael M. Swift
DSN
2007
IEEE
14 years 2 months ago
Scaling and Continuous Availability in Database Server Clusters through Multiversion Replication
In this paper, we study replication techniques for scaling and continuous operation for a dynamic content server. Our focus is on supporting transparent and fast reconfiguration ...
Kaloian Manassiev, Cristiana Amza
ICON
2007
IEEE
14 years 2 months ago
A New Pre-emption Policy For MPLS-TE Networks
— The pre-emption mechanism may be used in Multi Protocol Label Switching Traffic Engineering (MPLS-TE) networks in order to reduce the number of rejected tunnels during failure...
Imène Chaieb, Jean-Louis Le Roux, Bernard C...