EDF Scheduling Algorithm for Periodic Messages On Switched Ethernet

Myung-Kyun Kim () and Dao Manh Cuong
Additional contact information
Myung-Kyun Kim: University of Ulsan, School of Computer Engineering and Information Communication
Dao Manh Cuong: University of Ulsan, School of Computer Engineering and Information Communication

A chapter in Modeling, Simulation and Optimization of Complex Processes, 2008, pp 313-322 from Springer

Abstract: Abstract The switched Ethernet offers many attractive features for real-time communications such as traffic isolation, providing large bandwidth, and full-duplex links, but the real-time features may be affected due to the collisions on an output port. This paper analyzes the schedulability condition for real-time periodic messages on a switched Ethernet where all nodes operate in a synchronized mode. This paper also proposes a EDF (Earliest Deadline First)-based scheduling algorithm to support the real-time features of the periodic traffic over switched Ethernet without any change in the principles of switched Ethernet. The proposed algorithm allows dynamic addition of new periodic messages during system running, which gives more flexibility to designing the real-time systems.

Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-79409-7_21

Ordering information: This item can be ordered from
http://www.springer.com/9783540794097

DOI: 10.1007/978-3-540-79409-7_21

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().