Preventing interrupt overload

Proceedings of the ACM SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES)

Volumn , Issue , 2005, Pages 50-58

  Regehr, John ^a   Duongsaa, Usit ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

Embedded; Interrupts; Overload; Scheduling

Indexed keywords

EMBEDDED; INTERRUPTS; OVERLOAD;

ACCIDENT PREVENTION; COMPUTER HARDWARE; MICROPROCESSOR CHIPS; PERFORMANCE; PROGRAM PROCESSORS; SCHEDULING;

EMBEDDED SYSTEMS;

EID: 31844431932     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Luca Abeni and Giuseppe Lipari. Compensating for interrupt process times in real-time multimedia systems. In Proc. of the 3rd Real-Time Linux Workshop, Work in Progress Session, Milan, Italy, November 2001.
2. Ian Broster and Alan Burns. An analysable bus-guardian for event-triggered communication. In Proc. of the 24th IEEE Real-Time Systems Symp. (RTSS), pages 410-419, Cancun, Mexico, December 2003.
3. Intel Corporation. 21143 PCI/CardBus 10/100Mb/s Ethernet LAN Controller, October 1998. ftp://download.intel.com/design/ network/manuals/27807401.pdf.
4. Uwe Dannowski and Hermann Härtig. Policing offloaded. In Proc. of the 6th IEEE Real-Time Technology and Applications Symp. (RTAS), pages 218-227, Washington, DC, May 2000.
5. Peter Druschel and Gaurav Banga. Lazy Receiver Processing (LRP): A network subsystem architecture for server systems. In Proc. of the 2nd Symp. on Operating Systems Design and Implementation, pages 261-276, Seattle, WA, October 1996.
6. Jakob Engblom, Andreas Ermedahl, Mikael Nolin, Jan Gustafsson, and Hans Hansson. Worst-case execution-time analysis for embedded real-time systems. Journal of Software Tool and Transfer Technology (STTT), 4(4):437-455, August 2003.
7. Ethernut: Tiny embedded Ethernet devices. http://www.ethernut.de.
8. Laurent George, Nicolas Rivierre, and Marco Spun. Preemptive and non-preemptive real-time uni-processor scheduling. Technical Report 2966, INRIA, Rocquencourt, France, September 1996.
9. Dan Hildebrand. An architectural overview of QNX. In Proc. of the USENIX Workshop on Micro-kernels and Other Kernel Architectures, pages 113-126, Seattle, WA, April 1992.
10. Jason Hill, Robert Szewczyk, Alec Woo, Seth Hollar, David Culler, and Kristofer Pister. System architecture directions for networked sensors. In Proc. of the 9th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 93-104, Cambridge, MA, November 2000.
11. Kevin Jeffay and Steve Goddard. A theory of rate-based execution. In Proc. of the 20th IEEE Real-Time Systems Symp. (RTSS), pages 304-314, Phoenix, AZ, December 1999.
12. Michael B. Jones, Daniela Roşu, and Marcel-Cǎtǎlin Roşu. CPU Reservations and Time Constraints: Efficient, predictable scheduling of independent activities. In Proc. of the 16th ACM Symp. on Operating Systems Principles (SOSP), pages 198-211, Saint-Malô, France, October 1997.
13. Scott Karlin and Larry Peterson. Maximum packet rates for full-duplex Ethernet. Technical Report TR-645-02, Princeton University, February 2002.
14. Hermann Kopetz. The time-triggered model of computation. In Proc. of the 19th IEEE Real-Time Systems Symp. (RTSS), pages 168-177, Madrid, Spain, December 1998.
15. Ian Leslie, Derek McAuley, Richard Black, Timothy Roscoe, Paul Barham, David Evers, Robin Fairbairns, and Eoin Hyden. The design and implementation of an operating system to support distributed multimedia applications. IEEE Journal on Selected Areas in Communications, 14(7):1280-1297, September 1996.
16. C. L. Liu and James W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46-61, January 1973.
17. Thomas Lundqvist and Per Stenström. An integrated path and timing analysis method based on cycle-level symbolic execution. Journal of Real-Time Systems, 17(2/3):183-207, November 1999.
18. Clifford W. Mercer, Stefan Savage, and Hideyuki Tokuda. Processor capacity reserves for multimedia operating systems. In Proc. of the IEEE Intl. Conf. on Multimedia Computing and Systems, May 1994.
19. Jeffrey C. Mogul and K. K. Ramakrishnan. Eliminating receive livelock in an interrupt-driven kernel. ACM Transactions on Computer Systems, 15(3):217-252, August 1997.
20. Charles Murray and Catherine Bly Cox. Apollo: The Race to the Moon. Simon and Schuster, 1989.
21. Jason Nieh, James G. Hanko, J. Duane Northcutt, and Gerard A. Wall. SVR4 UNIX scheduler unacceptable for multimedia applications. In Proc. of the 4th Intl. Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV), November 1993.
22. OpenCores. http://www.opencores.org.
23. John Regehr, Alastair Reid, Kirk Webb, Michael Parker, and Jay Lepreau. Evolving real-time systems using hierarchical scheduling and concurrency analysis. In Proc. of the 24th IEEE Real-Time Systems Symp. (RTSS), Cancun, Mexico, December 2003.
24. John Regehr and John A. Stankovic. Augmented CPU reservations: Towards predictable execution on general-purpose operating systems. In Proc. of the 7th IEEE Real-Time Technology and Applications Symp. (RTAS), pages 141-148, Taipei, Taiwan, May 2001.
25. Manas Saksena and Yun Wang. Scalable real-time system design using preemption thresholds. In Proc. of the 21st IEEE Real-Time Systems Symp. (RTSS), Orlando, FL, November 2000.
26. Lui Sha, Ragunathan Rajkumar, and Shirish S. Sathaye. Generalized rate-monotonic scheduling theory: A framework for developing real-time systems. Proc. of the IEEE, 82(1):68-82, January 1994.
27. Brinkley Sprunt, Lui Sha, and John P. Lehoczky. Aperiodic task scheduling for hard real-time systems. Real-Time Systems Journal, 1(1):27-60, June 1989.
28. TimeSysCorporation. TimeSys Linux, http://timesys.com/.
29. Ken Tindell, Alan Burns, and Andy J. Wellings. An extendible approach for analysing fixed priority hard real-time tasks. Real-Time Systems Journal, 6(2):133-151, March 1994.