Sciweavers

3178 search results - page 566 / 636
» Survivability Analysis of Networked Systems
Sort
View
PPOPP
1997
ACM
15 years 10 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon
BMCBI
2008
158views more  BMCBI 2008»
15 years 6 months ago
Bioinformatics in Italy: BITS2007, the fourth annual meeting of the Italian Society of Bioinformatics
spectives. A total of 149 abstracts were accepted and presented in the poster session and 31 of them were selected for oral presentation. At the opening of the meeting, Roderic Gui...
Graziano Pesole, Manuela Helmer-Citterich
PODC
2009
ACM
16 years 1 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
LCTRTS
2009
Springer
16 years 1 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr
ATVA
2004
Springer
146views Hardware» more  ATVA 2004»
15 years 11 months ago
A Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
Tadaaki Tanimoto, Suguru Sasaki, Akio Nakata, Teru...