Sciweavers

5448 search results - page 501 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
214
Voted
ICDCS
2005
IEEE
16 years 26 days ago
Optimal Asynchronous Garbage Collection for RDT Checkpointing Protocols
Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordinatio...
Rodrigo Schmidt, Islene C. Garcia, Fernando Pedone...
IPPS
2005
IEEE
16 years 25 days ago
NUMA-Aware Java Heaps for Server Applications
We introduce a set of techniques to both measure and optimize memory access locality of Java applications running on cc-NUMA servers. These techniques work at the object level and...
Mustafa M. Tikir, Jeffrey K. Hollingsworth
ISPAN
2005
IEEE
16 years 25 days ago
Secure Continuity for Sensor Networks
Addition of new nodes to a Sensor Network is a fundamental requirement for their continuity operation over time. We analyze the weakening of security due to node capture when addi...
Arjan Durresi, Vijay Bulusu, Vamsi Paruchuri, Leon...
ISPAN
2005
IEEE
16 years 25 days ago
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng
189
Voted
CAISE
2005
Springer
16 years 24 days ago
Dynamic AOP with PROSE
Abstract. Dynamic Aspect-Oriented Programming (d-AOP) is an important tool to implement adaptation in a wide variety of applications. In particular, large distributed infrastructur...
Angela Nicoara, Gustavo Alonso