Sciweavers

819 search results - page 70 / 164
» Parallelization with Tree Skeletons
Sort
View
HPCC
2007
Springer
15 years 4 months ago
Quantification of Cut Sequence Set for Fault Tree Analysis
A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can indu...
Dong Liu, Chunyuan Zhang, Weiyan Xing, Rui Li, Hai...
CONCUR
2006
Springer
14 years 11 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
PPOPP
2010
ACM
15 years 7 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
IPPS
2007
IEEE
15 years 4 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert
IPPS
2006
IEEE
15 years 3 months ago
Phylospaces: reconstructing evolutionary trees in tuple space
Phylospaces is a novel framework for reconstructing evolutionary trees in tuple space, a distributed shared memory that permits processes to communicate and coordinate with each o...
Marc L. Smith, Tiffani L. Williams