Sciweavers

819 search results - page 121 / 164
» Parallelization with Tree Skeletons
Sort
View
CONCUR
2000
Springer
14 years 3 months ago
Weak Bisimulation for Probabilistic Systems
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
Anna Philippou, Insup Lee, Oleg Sokolsky
ICDCS
1998
IEEE
14 years 3 months ago
A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks
Novel real-time applications require highperformance real-time distributed systems, and therefore high-performance real-time networks. We examine a Hard Real-Time Distributed Mult...
Jean-François Hermant, Gérard Le Lan...
IPPS
1998
IEEE
14 years 3 months ago
Improved Concurrency Control Techniques For Multi-Dimensional Index Structures
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
Kothuri Venkata Ravi Kanth, David Serena, Ambuj K....
ICPP
1994
IEEE
14 years 3 months ago
A Distributed Cache Coherence Protocol for Hypercube Multiprocessors
- This paper proposes a distributed directory cache coherence protocol and compares the performance of the proposed protocol with fully mapped and single linked list protocols for ...
Yeimkuan Chang, Laxmi N. Bhuyan, Akhilesh Kumar
DEBS
2007
ACM
14 years 20 days ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma