Embedded software in network processors - Models and algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2211, Issue , 2001, Pages 416-434

  Thiele, Lothar ^a   Chakraborty, Samarjit ^a   Gries, Matthias ^a   Maxiaguine, Alexander ^a   Greutert, Jonas ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; EMBEDDED SOFTWARE; EMBEDDED SYSTEMS; INTEGRATED CIRCUIT DESIGN; MULTITASKING; PACKET NETWORKS; QUALITY OF SERVICE;

DATA THROUGHPUT; DESIGN SPACE EXPLORATION; MODELS AND ALGORITHMS; NETWORK PROCESSOR; PACKET SCHEDULING; QUALITY OF SERVICE CONSTRAINTS; TASK-SCHEDULING; TASK-SCHEDULING ALGORITHMS;

SCHEDULING ALGORITHMS;

EID: 84947274694     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45449-7_29     Document Type: Article

References (30)

1. R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan. Performance bounds for flow control protocols. IEEE/ACM Transactions on Networking, 7(3):310-323, 1999
2. N. Audsley, A. Burns, M. Richardson, and A. Wellings. Fixed priority preemptive scheduling: A historical perspective. Real-Time Systems, 8:173-198, 1995
3. F. Baccelli, G. Cohen, G.J. Olsder, and J.-P. Quadrat. Synchronization and Linearity. John Wiley, Sons, New York, 1992
4. S.K. Baruah. Dynamic-and static-priority scheduling of recurring real-time tasks, 2001. To appear in Real-Time Systems
5. A. Bavier and L. Peterson. BERT: A scheduler for best effort and real-time tasks. Technical Report TR-602-99, Department of Computer Science, Princeton University, 2001. Revised in January 2001
6. T. Blickle, J. Teich, and L. Thiele. System-level synthesis using evolutionary algorithms. Design Automation for Embedded Systems, 3(1):23-58, 1998
7. J.Y. Le Boudec. Application of network calculus to guaranteed service networks. IEEE Trans on Information theory, 44(3), May 1998
8. J.Y. Le Boudec and P. Thiran. Network Calculus-A Theory of Deterministic Queuing Systems for the Internet. LNCS 2050, Springer Verlag, 2001
9. G.C. Buttazzo. Hard Real-Time Computing Systems-Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers, 1997
10. G.C. Buttazzo and F. Sensini. Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments. IEEE Transactions on Computers, 48(10):1035-1052, 1999
11. S. Chakraborty, T. Erlebach, and L. Thiele. On the complexity of scheduling conditional real-time code. In Proc. 7th International Workshop on Algorithms and Data Structures (WADS), LNCS 2125, 2001
12. R.L. Cruz. A calculus for network delay. IEEE Trans. Information Theory, 37(1):114-141, 1991
13. K. Deb. Multi-objective optimization using evolutionary algorithms. John Wiley, Chichester, 2001
14. D. Decasper, Z. Dittia, G.M. Parulkar, and B. Plattner. Router plugins: A software architecture for next-generation routers. IEEE/ACM Transactions on Networking, 8(1):2-15, 2000
15. A. Demers, S. Keshav, and S. Shenkar. Analysis and simulation of a fair queueing algorithm. Journal of Internetworking Research and Experience, 1(1):3-26, 1990
16. E. Kohler, R. Morris, B. Chen, J. Jannotti, and M.F. Kaashoek. The Click modular router. ACM Transactions on Computer Systems, 18(3):263-297, 2000
17. J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm. In Proc. IEEE Real-Time Systems Symposium, pages 166-171, 1989
18. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in hard realtime environment. Journal of the ACM, 20(1):46-61, 1973
19. L. Thiele M. Eisenring, E. Zitzler. Handling conflicting criteria in embedded system design. IEEE Design & Test of Computers, 17(2):51-59, 2000
20. G. De Micheli. Synthesis and Optimization of Digital Circuits. McGraw-Hill International Editions, New York, 1994
21. A.K. Mok and D. Chen. A multiframe model for real-time tasks. IEEE Transactions on Software Engineering, 23(10):635-645, 1997
22. The Moses project homepage. http://www.tik.ee.ethz.ch/∼moses/
23. M. Naedele, L. Thiele, and M. Eisenring. General task and resource models for processor task scheduling, 1998. TIK Report 45, ETH Zürich
24. M. Naedele, L. Thiele, and M. Eisenring. Characterizing variable task releases and processor capacities. In Proceedings of the 14th IFAC World Congress, 1999
25. A.K. Parekh and R.G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking, 1(3):344-357, 1993
26. S. Prakash and A.C. Parker. Synthesis of application-specific multiprocessor systems including memory components. In Proc. IEEE Application Specific Array Processors, 1992
27. X. Qie, A. Bavier, L. Peterson, and S. Karlin. Scheduling computations on a software-based router. In Proc. SIGMETRICS, 2001
28. S. Shenker and J. Wroclawski. General characterization parameters for integrated service network elements. RFC 2215, IETF, September 1997
29. L. Thiele, S. Chakraborty, and M. Naedele. Real-time calculus for scheduling hard real-time systeme. In Proc. IEEE Internation Conference on Circuits and Systems, 2000
30. E. Zitzler, J. Teich, and S.S. Bhattacharyya. Evolutionary algorithms for the synthesis of embedded software. IEEE Transactions on VLSI Systems, 8(4):452-456, August 2000.