Predictive scheduling of network processors

Computer Networks

Volumn 41, Issue 5, 2003, Pages 601-621

  Wolf, Tilman ^a   Pappu, Prashanth ^b   Franklin, Mark A ^b  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Fair queuing; Locality aware scheduling; Network processors; Programmable networks; Scheduling

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; DATA FLOW ANALYSIS; QUALITY OF SERVICE; REDUCED INSTRUCTION SET COMPUTING; ROUTERS;

PREDICTIVE SCHEDULING;

MULTIPROCESSING SYSTEMS;

EID: 0037420675     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(02)00452-8     Document Type: Article

References (28)

1. J. Bennett, H. Zhang, Worst case fair weighted fair queuing, in: Proceedings of IEEE INFOCOM 95, Boston, MA, April 1995, pp. 120-128.
2. J.C.R. Bennett, H. Zhang, Hierarchial packet fair queuing algorithms, in: Proceedings of ACM SIGCOMM, Palo Alto, CA, August 1996, 43-56.
3. J.M. Blanquer, B. Ozden, Fair queuing for aggregated multiple links, in: Proceedings of ACM SIGCOMM 2001, San Diego, CA, August 2001.
4. T. Chaney, A. Fingerhut, M. Flucke, J. Turner, Design of a gigabit ATM switch, in: Proceedings of IEEE INFOCOM 97, Kobe, Japan, April 1997.
5. Y. Chen, J.S. Turner, Design of a weighted fair queueing cell scheduler for ATM networks, in: Proceedings of IEEE GLOBECOM 98, Sydney, Australia, November 1998.
6. S.Y. Choi, J.S. Turner, T. Wolf, Configuring sessions in programmable networks, in: Proceedings of the Twentieth IEEE Conference on Computer Communications (INFOCOM), Anchorage, AK, April 2001, pp. 60-66.
7. D. Decasper, Z. Dittia, G. Parulkar, B. Plattner, Router Plugins - a modular and extensible software framework for modern high performance integrated services routers, in: Proceedings of ACM SIGCOMM 98, Vancouver, BC, September 1998.
8. Decasper D., Parulkar G., Choi S., DeHart J., Wolf T., Plattner B. A scalable, high performance active network node. IEEE Network. 31(1):1999;8-19.
9. J.D. DeHart, W.D. Richard, E.W. Spitznagel, D.E. Taylor, The smart port card: An embedded UNIX processor architecure for network management and active networking, Technical report WUCS-01-18, Department of Computer Science, Washington University, St. Louis, August 2001.
10. M. Devarakonda, A. Mukherjee, Issues in implementation of cache-affinity scheduling, in: Proceedings of Winter USENIX Conference, January 1992, pp. 345-357.
11. V. Galtier, K.L. Mills, Y. Carlinet, S. Leigh, A. Rukhin, Expressing meaningful processing requirements among heterogeneous nodes in an active network, in: Proceedings of the Second International Workshop on Software and Performance, Ottawa, Canada, September 2000.
12. S.J. Golestani, A self clocked fair queuing scheme for broadband applications, in: Proceedings of IEEE INFOCOM 94, Toronto, Canada, June 1994, pp. 636-646.
13. P. Goyal, H.M. Vin, H. Cheng. A hierarchial cpu scheduler for multimedia operating systems, in: Proceedings of the Second USENIX Symposium on Operating System Design and Implementation (OSDI), Seattle, WA, October 1996, pp. 107-121.
14. P. Goyal, H.M. Vin, H. Cheng, Start-time fair queuing: a scheduling algorithm for integrated services packet switching networks, in: Proceedings of ACM SIGCOMM, ACM, Palo Alto, CA, August 1996, pp. 157-168.
15. IBM Corp. IBM Power Network Processors, 2000. Available from 〈http://www.chips.ibm.com/products/wired/communications/network_processors. html〉.
16. Intel Corp. Intel IXP2800 Network Processor, 2002. Available from 〈http://developer.intel.com/design/network/products/npfamily/ixp2800.htm 〉.
17. J.T. Moore, M. Hicks, S. Nettles, Practical programmable packets, in: Proceedings of IEEE INFOCOM 2001, Anchorage, AK, April 2001, pp. 49-59.
18. A.K. Parekh, R.G. Gallager, A generalized processor sharing approach to flow control: the single node case, in: Proceedings of IEEE INFOCOM 92, Florence, Italy, May 1992, pp. 915-924.
19. L. Peterson (Ed.), NodeOS interface specification, Technical report, AN Node OS Working Group, January 2001.
20. J. Philbin, J. Edler, O.J. Anshus, C.C. Douglas, K. Li, Thread scheduling for cache locality, in: Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, Cambridge, MA, October 1996.
21. X. Qie, A. Bavier, L. Peterson, S. Karlin, Scheduling computations on a software-based router, in: Proceedings of IEEE Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), Cambridge, MA, June 2001, pp. 13-24.
22. J.D. Salehi, J.F. Kurose, D. Towsley, The effectiveness of affinity-based scheduling in multiprocessor networking, in: Proceedings of IEEE INFOCOM 96, San Francisco, CA, March 1996.
23. Squillante M.S., Lazowska E.D. Using processor cache affinity information in shared-memory multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems. 4(2):1993;131-143.
24. Stiliadis D., Varma A. Rate proportional servers: a design methodology for fair queuing algorithms. IEEE/ACM Transactions on Networking. 6(2):1998;164-174.
25. Torrellas J., Tucker A., Gupta A. Evaluating the performance of cache-affinity scheduling in shared-memory multiprocessors. Journal of Parallel and Distributed Computing. 24:1995;139-151.
26. R. Vaswani, J. Zahorjan, The implications of cache affinity on processor scheduling for multiprogrammed, shared memory multiprocessors, in: Proceedings of Thirteenth Symposium on Operating Systems Principles, Pacific Grove, CA, October 1991, pp. 26-40.
27. T. Wolf, M.A. Franklin, CommBench - a telecommunications benchmark for network processors, in: Proceedings of IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), Austin, TX, April 2000, pp. 154-162.
28. Zhang H. Service disciplines for guaranteed performance service in packet switching networks. Proceedings of the IEEE. 83(10):1995;1374-1396.