Sciweavers

1529 search results - page 219 / 306
» Energy-Based Models of P Systems
Sort
View
SPAA
2009
ACM
15 years 10 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
ISSRE
2002
IEEE
15 years 2 months ago
Toward A Quantifiable Definition of Software Faults
An important aspect of developing models relating the number and type of faults in a software system to a set of structural measurement is defining what constitutes a fault. By de...
John C. Munson, Allen P. Nikora
IPPS
2009
IEEE
15 years 4 months ago
The Weak Mutual Exclusion problem
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
Paolo Romano, Luís Rodrigues, Nuno Carvalho
RTAS
2005
IEEE
15 years 3 months ago
Scalable QoS-Based Resource Allocation in Hierarchical Networked Environment
In this paper, we study the problem of allocating end-toend bandwidth to each of multiple traffic flows in a largescale network. We adopt the QoS-based Resource Allocation Model...
Sourav Ghosh, Ragunathan Rajkumar, Jeffery P. Hans...
OTM
2005
Springer
15 years 3 months ago
Peer-to-Peer Distribution Architectures Providing Uniform Download Rates
Peer-to-peer (P2P) networks have proved to be a powerful and highly scalable alternative to traditional client-server architectures for content distribution. They offer the techni...
Marc Schiely, Pascal Felber