A novel distributed scheduling algorithm for resource sharing under near-heavy load

Lecture Notes in Computer Science

Volumn 3544, Issue , 2005, Pages 431-442

  Carvalho, D ^a   Protti, Fábio ^a   De Gregorio, Massimo ^b   França, Felipe M G ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b CNR   (Italy)

Author keywords

Dining philosophers problem; Distributed algorithms; Distributed traffic light control; Graph dynamics; Mutual exclusion; Resource sharing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COSTS; INFORMATION THEORY; SCHEDULING; TELECOMMUNICATION TRAFFIC;

DINING PHILOSOPHERS PROBLEM; DISTRIBUTED ALGORITHMS; DISTRIBUTED TRAFFIC LIGHT CONTROL; GRAPH DYNAMICS; MUTUAL EXCLUSION; RESOURCE-SHARING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 26444590953     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11516798_31     Document Type: Conference Paper

References (27)

1. th Annual ACM Symposium on Principles of Distributed Computing, pages 193-200, August 1989.
2. D. Agrawala and A. El Abbadi. Exploiting logical structures in replicated databases. Inf. Proc. Letters, 33:255-260, 1990.
3. A. Arnold, M. Naimi, and M. Tréhel. A log n distributed mutual exclusion algorithm based on the path reversal. Journal of Parallel and Distributed Computing, 34:1-13, 1996.
4. Valmir Barbosa and Eli Gafni. Concurrency in heavily loaded neighborhood-constrained systems. ACM Transactions on Programming Languages and Systems, 11(4):562-584, October 1989.
5. Valmir Carneiro Barbosa. Concurrency in Systems with Neighborhood Constraints. Ph.D. thesis, UCLA Computer Science Department, Los Angeles, 1986.
6. D. Carvalho, F. M. G. França, and F. Protti. Pseudo-code of Scheduling by Edge Reversal with Hibernation, http://www.if.ufrj.br/~carvalho/ serh.html, 2004.
7. O. S. F. Carvalho and G. Roucariol. On mutual exclusion in computer networks. Communications of ACM, 26(2): 145-147, 1983.
8. K. M. Chandy and Jayadev Misra. The drinking philosopher's problem. ACM Transactions on Programming Languages and Systems, 6(4):632-646, October 1984.
9. E. W. Dijkstra. Hierarchical ordering of sequencial processes. Acta Informatica, 1(2):115-138, 1971.
10. Eli M. Gafni and Dimitri P. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications, 29(1):11-18, 1981.
11. th Annual ACM Symposium on Principles of Distributed Computing, pages 150-159, 1989.
12. Kenneth Goldman and Joe Hoffert. A modification to the chandy-misra dining philosophers algorithm to suport dynamic resource conflict graphs, submetido para Information Processing Letters.
13. N. Plouzeau J. M. Helary and M. Raynal. A distributed algorithm for mutual exclusion in an arbritary network. The Computer Journal, 31(4):289-295, 1988.
14. Yuh-Jzer Joung. Asynchronous group mutual exclusion. In Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC '98), pages 51-60, New York, June 1998. Association for Computing Machinery.
15. J. Kramer and J. Magee. The Evolving Philosophers Problem: Dynamic Change Management. IEEE Transactions on Software Engineering, 16(11):1293-1306, November 1990.
16. G. Le Lann. Distributed systems: towards of formal approach. In IFIP Congress, pages 155-160, North-Holland, 1977.
17. th ACM Symposium on Operating Systems Principles, pages 137-151, 1987.
18. M. A. Maekawa. A √n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145-159, 1985.
19. J. A. Martin. Distributed mutual exclusion on a ring of processors. Science of Computer Programming, 5:256-276, 1985.
20. H. Garcia Molina and D. Barbara. How to assign votes in a distributed system. Jornal of the ACM, 32(4):150-159, 1985.
21. K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, 7(1):61-77, 1989.
22. M. Raynal. Prime numbers as a tool to design distributed algorithms. Inf. Process. Lett., 33(1):53-58, 1989.
23. Michel Raynal. A simple taxonomy for distributed mutual exclusion algorithms. Operation Systems Review, 25:47-50, 1991.
24. th International Conference on distributed Computer Systems (ICDCS '95), pages 161-168, 1995.
25. P. C. Saxena and J. Rai. A survey of permission-based distributed mutual exclusion algorithms. Computer Standards and Interfaces, 25:159-181, 2003.
26. Walter, Welch, and Vaidya. A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks: The Journal of Mobile Communication, Computation and Information, Kluwer, 7, 2001.
27. J. L. Welch and N. A. Lynch. A modular drinking philosophers algorithm. Distributed Computing, 6:233-244, 1993.