Sciweavers

4889 search results - page 512 / 978
» A Refactoring Approach to Parallelism
Sort
View
CONCUR
2001
Springer
15 years 11 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
ICDCS
2000
IEEE
15 years 11 months ago
Scalable QoS Guaranteed Communication Services for Real-Time Applications
In this paper, we propose an approach to flow-unaware admission control, which is combination with an aggregate packet forwarding scheme, improves scalability of networks while g...
Byung-Kyu Choi, Dong Xuan, Chengzhi Li, Riccardo B...
ICDCS
2000
IEEE
15 years 11 months ago
Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments
The increasing popularity and diversity of collaborative applications prompts a need for highly secure and reliable communication platforms for dynamic peer groups. Security mecha...
Jonathan Robert Stanton, Yair Amir, Damian Hasse, ...
ICPP
2000
IEEE
15 years 11 months ago
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
Jie Wu, Hailan Li
IPPS
2000
IEEE
15 years 11 months ago
Micro-Architectures of High Performance, Multi-User System Area Network Interface Cards
This paper examines two Network Interface Card microarchitectures that support low latency, high bandwidth userlevel message passing in multi-user environments. The two are at dif...
Boon Seong Ang, Derek Chiou, Larry Rudolph, Arvind