Scalability of a distributed real-time resource counter
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors address the topic of how to meet a real-time constraint as the load on a distributed system increases, without increasing the capacity of the individual processors. The application studied is a real-time resource counter with a probabilistic correctness criterion, and is motivated by the problem of implementing resource management in the telephone network. They introduce a model that combines distributed computing, real-time constraints, probabilistic correctness, and large system size; to the authors' knowledge, no previous work addresses this combination.Keywords
This publication has 8 references indexed in Scilit:
- Time bounds for real-time process control in the presence of timing uncertaintyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Efficient solution to the distributed mutual exclusion problemPublished by Association for Computing Machinery (ACM) ,1989
- New models and algorithms for future networksPublished by Association for Computing Machinery (ACM) ,1988
- Optimal clock synchronizationJournal of the ACM, 1987
- Probabilistic analysis of a network resource allocation algorithmInformation and Control, 1986
- Distributed resource sharing in computer networksPublished by Springer Nature ,1986
- A new fault-tolerant algorithm for clock synchronizationPublished by Association for Computing Machinery (ACM) ,1984
- Some Properties of the Erlang Loss FunctionBell System Technical Journal, 1974