Sciweavers

122 search results - page 13 / 25
» Using Disjoint Reachability for Parallelization
Sort
View
PODC
1997
ACM
13 years 11 months ago
Collecting Distributed Garbage Cycles by Back Tracing
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-sit...
Umesh Maheshwari, Barbara Liskov
STTT
2010
115views more  STTT 2010»
13 years 5 months ago
Scalable shared memory LTL model checking
Recent development in computer hardware has brought more wide-spread emergence of shared memory, multi-core systems. These architectures offer opportunities to speed up various ta...
Jiri Barnat, Lubos Brim, Petr Rockai
CLUSTER
2006
IEEE
14 years 1 months ago
I/O Scheduling Service for Multi-Application Clusters
Distributed applications, especially the ones being I/O intensive, often access the storage subsystem in a non-sequential way (stride requests). Since such behaviors lower the ove...
Adrien Lebre, Guillaume Huard, Yves Denneulin, Prz...
IFM
2004
Springer
185views Formal Methods» more  IFM 2004»
14 years 24 days ago
Object-Oriented Modelling with High-Level Modular Petri Nets
Abstract. In this paper, we address the problem of expressing objectoriented concepts in terms of Petri nets. This is interesting, first, as a possibility of representing concurre...
Cécile Bui Thanh, Hanna Klaudel
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
13 years 5 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen