{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:46:16Z","timestamp":1733982376998,"version":"3.30.2"},"reference-count":28,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1389-1286(02)00452-8","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T18:07:53Z","timestamp":1045505273000},"page":"601-621","source":"Crossref","is-referenced-by-count":21,"title":["Predictive scheduling of network processors"],"prefix":"10.1016","volume":"41","author":[{"given":"Tilman","family":"Wolf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prashanth","family":"Pappu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark A.","family":"Franklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(02)00452-8_BIB1","doi-asserted-by":"crossref","unstructured":"J. Bennett, H. Zhang, Worst case fair weighted fair queuing, in: Proceedings of IEEE INFOCOM 95, Boston, MA, April 1995, pp. 120\u2013128","DOI":"10.1109\/INFCOM.1996.497885"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB2","doi-asserted-by":"crossref","unstructured":"J.C.R. Bennett, H. Zhang, Hierarchial packet fair queuing algorithms, in: Proceedings of ACM SIGCOMM, Palo Alto, CA, August 1996, 43\u201356","DOI":"10.1145\/248156.248170"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB3","doi-asserted-by":"crossref","unstructured":"J.M. Blanquer, B. Ozden, Fair queuing for aggregated multiple links, in: Proceedings of ACM SIGCOMM 2001, San Diego, CA, August 2001","DOI":"10.1145\/383059.383074"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB4","doi-asserted-by":"crossref","unstructured":"T. Chaney, A. Fingerhut, M. Flucke, J. Turner, Design of a gigabit ATM switch, in: Proceedings of IEEE INFOCOM 97, Kobe, Japan, April 1997","DOI":"10.1109\/INFCOM.1997.635108"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB5","unstructured":"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"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB6","unstructured":"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\u201366"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB7","unstructured":"D. Decasper, Z. Dittia, G. Parulkar, B. Plattner, Router Plugins\u2013\u2013a modular and extensible software framework for modern high performance integrated services routers, in: Proceedings of ACM SIGCOMM 98, Vancouver, BC, September 1998"},{"issue":"1","key":"10.1016\/S1389-1286(02)00452-8_BIB8","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/65.750445","article-title":"A scalable, high performance active network node","volume":"31","author":"Decasper","year":"1999","journal-title":"IEEE Network"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB9","unstructured":"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"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB10","unstructured":"M. Devarakonda, A. Mukherjee, Issues in implementation of cache-affinity scheduling, in: Proceedings of Winter USENIX Conference, January 1992, pp. 345\u2013357"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB11","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/350391.350398"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB12","doi-asserted-by":"crossref","unstructured":"S.J. Golestani, A self clocked fair queuing scheme for broadband applications, in: Proceedings of IEEE INFOCOM 94, Toronto, Canada, June 1994, pp. 636\u2013646","DOI":"10.1109\/INFCOM.1994.337677"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB13","doi-asserted-by":"crossref","unstructured":"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\u2013121","DOI":"10.1145\/238721.238766"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB14","doi-asserted-by":"crossref","unstructured":"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\u2013168","DOI":"10.1145\/248157.248171"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB15","unstructured":"IBM Corp. IBM Power Network Processors, 2000. Available from <http:\/\/www.chips.ibm.com\/products\/wired\/communications\/network_processors.html>"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB16","unstructured":"Intel Corp. Intel IXP2800 Network Processor, 2002. Available from <http:\/\/developer.intel.com\/design\/network\/products\/npfamily\/ixp2800.htm>"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB17","doi-asserted-by":"crossref","unstructured":"J.T. Moore, M. Hicks, S. Nettles, Practical programmable packets, in: Proceedings of IEEE INFOCOM 2001, Anchorage, AK, April 2001, pp. 49\u201359","DOI":"10.1109\/INFCOM.2001.916685"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB18","doi-asserted-by":"crossref","unstructured":"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\u2013924","DOI":"10.1109\/INFCOM.1992.263509"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB19","unstructured":"L. Peterson (Ed.), NodeOS interface specification, Technical report, AN Node OS Working Group, January 2001"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB20","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/237090.237151"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB21","doi-asserted-by":"crossref","unstructured":"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\u201324","DOI":"10.1145\/378420.378425"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB22","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/INFCOM.1996.497896"},{"issue":"2","key":"10.1016\/S1389-1286(02)00452-8_BIB23","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/71.207589","article-title":"Using processor cache affinity information in shared-memory multiprocessor scheduling","volume":"4","author":"Squillante","year":"1993","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"10.1016\/S1389-1286(02)00452-8_BIB24","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1109\/90.664265","article-title":"Rate proportional servers: a design methodology for fair queuing algorithms","volume":"6","author":"Stiliadis","year":"1998","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB25","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jpdc.1995.1014","article-title":"Evaluating the performance of cache-affinity scheduling in shared-memory multiprocessors","volume":"24","author":"Torrellas","year":"1995","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB26","doi-asserted-by":"crossref","unstructured":"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\u201340","DOI":"10.1145\/121132.121140"},{"key":"10.1016\/S1389-1286(02)00452-8_BIB27","doi-asserted-by":"crossref","unstructured":"T. Wolf, M.A. Franklin, CommBench\u2013\u2013a 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\u2013162","DOI":"10.1109\/ISPASS.2000.842295"},{"issue":"10","key":"10.1016\/S1389-1286(02)00452-8_BIB28","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1109\/5.469298","article-title":"Service disciplines for guaranteed performance service in packet switching networks","volume":"83","author":"Zhang","year":"1995","journal-title":"Proceedings of the IEEE"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128602004528?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128602004528?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:12:06Z","timestamp":1733940726000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128602004528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S1389128602004528"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(02)00452-8","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}