iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/11516798_31
A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load | SpringerLink
Skip to main content
Springer Nature Link
Log in

A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load

  • Conference paper
  • First Online:
Principles of Distributed Systems (OPODIS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3544))

Included in the following conference series:

  • 710 Accesses

Abstract

This paper introduces SERH – Scheduling by Edge Reversal with Hibernation, a novel distributed algorithm for the scheduling of atomic shared resources in the context of dynamic load reconfiguration. The new algorithm keeps the simplicity and daintiness of the Scheduling by Edge Reversal (SER) distributed algorithm, originally conceived to support the heavy load condition. Both SER and SERH distributed algorithms share the same communication and computational complexities and can also be seen as graph dynamics where the messages exchanged between a processing node and its neighbors are represented as “edge reversal” operations upon directed acyclic graphs representing the target distributed system. Nevertheless, SERH allows such distributed system to deal with the situation of having processing nodes leaving the heavy load behavior and going into a “hibernating” state, and vice versa. It is shown here that SERH has a communication cost approximately 25% lower than the traditional Chandy and Misra’s distributed solution, when operating near to heavy load conditions. In order to illustrate the usefulness of SERH in this interesting situation, an application in the distributed control of traffic lights of a road junction is also presented here.

Supported by CNPq, CAPES (Brazil) and CNR (Italy).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Agrawala, D., El Abbadi, A.: An efficient solution to the distributed mutual exclusion problem. In: Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pp. 193–200 (August 1989)

    Google Scholar 

  2. Agrawala, D., El Abbadi, A.: Exploiting logical structures in replicated databases. Inf. Proc. Letters 33, 255–260 (1990)

    Article  Google Scholar 

  3. Arnold, A., Naimi, M., Tréhel, M.: A logn distributed mutual exclusion algorithm based on the path reversal. Journal of Parallel and Distributed Computing 34, 1–13 (1996)

    Article  Google Scholar 

  4. Barbosa, V., Gafni, E.: Concurrency in heavily loaded neighborhood-constrained systems. ACM Transactions on Programming Languages and Systems 11(4), 562–584 (1989)

    Article  Google Scholar 

  5. Barbosa, V.C.: Concurrency in Systems with Neighborhood Constraints. Ph.D. thesis, UCLA Computer Science Department, Los Angeles (1986)

    Google Scholar 

  6. Carvalho, D., França, F.M.G., Protti, F.: Pseudo-code of Scheduling by Edge Reversal with Hibernation (2004), http://www.if.ufrj.br/~carvalho/serh.html

  7. Carvalho, O.S.F., Roucariol, G.: On mutual exclusion in computer networks. Communications of ACM 26(2), 145–147 (1983)

    Google Scholar 

  8. Chandy, K.M., Misra, J.: The drinking philosopher’s problem. ACM Transactions on Programming Languages and Systems 6(4), 632–646 (1984)

    Article  Google Scholar 

  9. Dijkstra, E.W.: Hierarchical ordering of sequencial processes. Acta Informatica 1(2), 115–138 (1971)

    Article  Google Scholar 

  10. Gafni, E.M., Bertsekas, D.P.: Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications 29(1), 11–18 (1981)

    Article  MathSciNet  Google Scholar 

  11. Gifford, K.D.: Weighted voting for replicated data. In: Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pp. 150–159 (1989)

    Google Scholar 

  12. Goldman, K., Hoffert, J.: A modification to the chandy-misra dining philosophers algorithm to suport dynamic resource conflict graphs. submetido para Information Processing Letters

    Google Scholar 

  13. Plouzeau, N., Helary, J.M., Raynal, M.: A distributed algorithm for mutual exclusion in an arbritary network. The Computer Journal 31(4), 289–295 (1988)

    Article  MathSciNet  Google Scholar 

  14. Joung, Y.-J.: Asynchronous group mutual exclusion. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC 1998), pp. 51–60. Association for Computing Machinery, New York (1998)

    Chapter  Google Scholar 

  15. Kramer, J., Magee, J.: The Evolving Philosophers Problem: Dynamic Change Management. IEEE Transactions on Software Engineering 16(11), 1293–1306 (1990)

    Article  Google Scholar 

  16. Le Lann, G.: Distributed systems: towards of formal approach. In: IFIP Congress, pp. 155–160. North-Holland, Amsterdam (1977)

    Google Scholar 

  17. Lynch, N.A., Tuttle, M.: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of 7th ACM Symposium on Operating Systems Principles, pp. 137–151 (1987)

    Google Scholar 

  18. Maekawa, M.A.: A \(\sqrt{n}\) algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2), 145–159 (1985)

    Article  Google Scholar 

  19. Martin, J.A.: Distributed mutual exclusion on a ring of processors. Science of Computer Programming 5, 256–276 (1985)

    Article  Google Scholar 

  20. Molina, H.G., Barbara, D.: How to assign votes in a distributed system. Jornal of the ACM 32(4), 150–159 (1985)

    MathSciNet  MATH  Google Scholar 

  21. Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems 7(1), 61–77 (1989)

    Article  Google Scholar 

  22. Raynal, M.: Prime numbers as a tool to design distributed algorithms. Inf. Process. Lett. 33(1), 53–58 (1989)

    Article  MathSciNet  Google Scholar 

  23. Raynal, M.: A simple taxonomy for distributed mutual exclusion algorithms. Operation Systems Review 25, 47–50 (1991)

    Article  Google Scholar 

  24. Rhee, I.: A fast distributed modular algorithm for resource allocation. In: Proceedings og the 15th International Conference on distributed Computer Systems (ICDCS 1995), pp. 161–168 (1995)

    Google Scholar 

  25. Saxena, P.C., Rai, J.: A survey of permission-based distributed mutual exclusion algorithms. Computer Standards and Interfaces 25, 159–181 (2003)

    Article  Google Scholar 

  26. Walter, J.E., Welch, J.L., Vaidya, N.H.: A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks: The Journal of Mobile Communication, Computation and Information 7 (2001)

    Google Scholar 

  27. Welch, J.L., Lynch, N.A.: A modular drinking philosophers algorithm. Distributed Computing 6, 233–244 (1993)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. COPPE – Engenharia de Sistemas e Computação, UFRJ, Rio de Janeiro, Brazil

    D. Carvalho

  2. NCE/Instituto de Matemática, UFRJ, Rio de Janeiro, Brazil

    Fábio Protti & Felipe M. G. França

  3. Istituto di Cibernetica – CNR, Pozzuoli (NA), Italy

    Massimo De Gregorio

Authors
  1. D. Carvalho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fábio Protti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Massimo De Gregorio
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Felipe M. G. França
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Japan Science Technology and Agency, CREST, Japan

    Teruo Higashino

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carvalho, D., Protti, F., De Gregorio, M., França, F.M.G. (2005). A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load. In: Higashino, T. (eds) Principles of Distributed Systems. OPODIS 2004. Lecture Notes in Computer Science, vol 3544. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11516798_31

Download citation

  • DOI: https://doi.org/10.1007/11516798_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27324-0

  • Online ISBN: 978-3-540-31584-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation