{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:06Z","timestamp":1759638786399,"version":"3.41.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1023\/a:1022952324290","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T22:16:51Z","timestamp":1049753811000},"page":"231-250","source":"Crossref","is-referenced-by-count":33,"title":["Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics"],"prefix":"10.1007","volume":"6","author":[{"given":"Jeff","family":"Edmonds","sequence":"first","affiliation":[]},{"given":"Donald D.","family":"Chinn","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Brecht","sequence":"additional","affiliation":[]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5117214_CR1","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/0166-5316(96)00030-2","volume":"27","author":"T. Brecht","year":"1996","unstructured":"Brecht, T. and K. Guha, \u201cUsing parallel program characteristics in dynamic multiprocessor allocation policies,\u201d Performance Evaluation, 27 & 28, 519-539 (October 1996).","journal-title":"Performance Evaluation"},{"key":"5117214_CR2","doi-asserted-by":"crossref","unstructured":"Chiang, S. H., R. K. Mansharamani, and M. Vernon, \u201cUse of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies,\u201d in Proc. 1994 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, 1994, pp. 33-44.","DOI":"10.1145\/183018.183023"},{"key":"5117214_CR3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1023\/A:1009790611712","volume":"1","author":"X. Deng","year":"1998","unstructured":"Deng, X. and P. Dymond, \u201cOn multiprocessor system scheduling,\u201d Journal of Combinatorial Optimization, Vol. 1, 1998, pp. 377-392, a special issue on Scheduling on Parallel\/Distributed Systems.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"5117214_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1137\/S0097539797315598","volume":"30","author":"X. Deng","year":"2000","unstructured":"Deng, X., N. Gu, T. Brecht, and K. Lu, \u201cPreemptive scheduling of parallel jobs on multiprocessors,\u201d SIAM J. Comput., 30(1), 145-160 (2000).","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5117214_CR5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/PL00009248","volume":"23","author":"X. Deng","year":"1999","unstructured":"Deng, X., and E. Koutsoupias, \u201cCompetitive implementation of parallel programs,\u201d Algorithmica, 23(1), 14-30 (1999).","journal-title":"Algorithmica"},{"key":"5117214_CR6","unstructured":"Edmonds, J., T. Brecht, D. Chinn, and X. Deng, \u201cNon-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics,\u201d Technical Report, York, 2000."},{"key":"5117214_CR7","doi-asserted-by":"crossref","unstructured":"Edmonds, J., \u201cScheduling in the dark,\u201d in STOC 1999 and Blum's Special Issue of the J. Theor. Comput. Sci., 1999, and in Proc. 31st Annu. ACM Symp. on Theory of Computing.","DOI":"10.1145\/301250.301299"},{"key":"5117214_CR8","doi-asserted-by":"crossref","unstructured":"Edmonds, J., \u201cScheduling in the dark,\u201d in Blum's Special Issue of the J. Theor. Comput. Sci., 1999 and in Proc. 31st Annu. ACM Symp. on Theory of Computing.","DOI":"10.1145\/301250.301299"},{"key":"5117214_CR9","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram, B. and K. Pruhs, \u201cSpeed is as powerful as clairvoyance,\u201d in Proc. 36th Symp. on Foundations of Computer Science, October 1995, pp. 214-221, and JACM, 2000.","DOI":"10.1109\/SFCS.1995.492478"},{"key":"5117214_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"Karlin, A., M. Manasse, L. Rudolph, and D. Sleator, \u201cCompetitive snoopy caching,\u201d Algorithmica, 3, 79-119 (1988).","journal-title":"Algorithmica"},{"issue":"9","key":"5117214_CR11","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/12.2259","volume":"37","author":"M. Kumar","year":"1988","unstructured":"Kumar, M., \u201cMeasuring parallelism in computation-intensive scientific\/engineering applications,\u201d IEEE Trans. Comput., 37(9), 1088-1098 (September 1988).","journal-title":"IEEE Trans. Comput."},{"key":"5117214_CR12","volume-title":"RC 17086 (75594)","author":"S. T. Leutenegger","year":"1991","unstructured":"Leutenegger, S. T. and R. D. Nelson, \u201cAnalysis of spatial and temporal scheduling policies for semi-static and dynamic multiprocessor environments,\u201d RC 17086 (75594), IBM T. J. Watson Research Center, Yorktown Heights, NY, August 1991."},{"key":"5117214_CR13","doi-asserted-by":"crossref","unstructured":"Leutenegger, S. and M. Vernon, \u201cThe performance of multiprogrammed multiprocessor scheduling policies,\u201d in Proc. 1990 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Boulder, Colorado, 1990, pp. 226-236.","DOI":"10.1145\/98457.98761"},{"key":"5117214_CR14","volume-title":"The Power of Choice in Scheduling Parallel Tasks, TR 1190","author":"W. Ludwig","year":"1993","unstructured":"Ludwig, W. and P. Tiwari, The Power of Choice in Scheduling Parallel Tasks, TR 1190, Computer Science Department, University of Wisconsin, Madison, November 1993."},{"key":"5117214_CR15","volume-title":"Qualitative Behavior of the EQS Parallel Processor Allocation Policy, TR 1192","author":"R. Mansharamani","year":"1993","unstructured":"Mansharamani, R. and M. K. Vernon, Qualitative Behavior of the EQS Parallel Processor Allocation Policy, TR 1192, Computer Sciences Department, University of Wisconsin, Madison, November 1993."},{"key":"5117214_CR16","doi-asserted-by":"crossref","unstructured":"Manasse, M., L. McGeoch, and D. Sleator, \u201cCompetitive algorithms for on-line problems,\u201d in Proc. 20th Annu. ACM Symp. on the Theory of Computing, 1988, pp. 322-333.","DOI":"10.1145\/62212.62243"},{"issue":"2","key":"5117214_CR17","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/151244.151246","volume":"11","author":"C. McCann","year":"1993","unstructured":"McCann, C., R. Vaswani, and J. Zahorjan, \u201cA dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors,\u201d ACM Trans. Comput. Syst., 11(2), 146-178 (1993).","journal-title":"ACM Trans. Comput. Syst."},{"key":"5117214_CR18","doi-asserted-by":"crossref","unstructured":"McCann, C. and J. Zahorjan, \u201cScheduling memory constrained jobs on distributed memory parallel computers,\u201d in Proc. Int. Joint Conf. on Measurement and Modeling of Computer Systems, ACM SIGMETRICS 95 and Performance 95, 1995, pp. 208-219.","DOI":"10.1145\/223587.223610"},{"key":"5117214_CR19","doi-asserted-by":"crossref","unstructured":"Motwani, R., S. Phillips, and E. Torng, \u201cNon-clairvoyant scheduling,\u201d in Proc. 4th Annu. ACM\/SIAM Symp. on Discrete Algorithms, Austin, Texas, January 1993, pp. 422-431 and Theor. Comput. Sci., 130, 17\u201347 (1994).","DOI":"10.1016\/0304-3975(94)90151-1"},{"key":"5117214_CR20","doi-asserted-by":"crossref","unstructured":"Nguyen, T., R. Vaswani, and J. Zahorjan, \u201cMaximizing speedup through self-tuning of processor allocation,\u201d in Proc. 10th Int. Parallel Processing Symp., Waikiki, HI, April 1996, pp. 463-468.","DOI":"10.1109\/IPPS.1996.508096"},{"key":"5117214_CR21","unstructured":"Schwiegelshohn, U., W. Ludwig, J. Wolf, J. Turek, and P. Yu, \u201cSmart SMART bounds for weighted response time scheduling,\u201d SIAM J. Comput., 1996 (in press)."},{"issue":"2\u20133","key":"5117214_CR22","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-5316(94)90036-1","volume":"19","author":"K. Sevcik","year":"1994","unstructured":"Sevcik, K., \u201cApplication scheduling and processor allocation in multiprogrammed parallel processing systems,\u201d Performance Evaluation, 19(2\u20133), 107-140 (1994).","journal-title":"Performance Evaluation"},{"issue":"2","key":"5117214_CR23","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D. and R. Tarjan, \u201cAmortized efficiency of list update and paging rules,\u201d Comm. ACM, 28(2), 202-208 (1985).","journal-title":"Comm. ACM"},{"key":"5117214_CR24","doi-asserted-by":"crossref","unstructured":"Tucker, A., and A. Gupta, \u201cProcess control and scheduling issues for multiprogrammed shared-memory multiprocessors,\u201d in Proc. 12th ACM Symp. on Operating Systems Principles, 1989, pp. 159-166.","DOI":"10.1145\/74850.74866"},{"key":"5117214_CR25","doi-asserted-by":"crossref","unstructured":"Turek, J., W. Ludwig, J. L. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, and P. S. Yu, \u201cScheduling parallelizable tasks to minimize average response time,\u201d in 6th Annu. ACM Symp. on Parallel Algorithms and Architectures, 1994a, pp. 200-209.","DOI":"10.1145\/181014.181331"},{"key":"5117214_CR26","unstructured":"Turek, J., U. Schwiegelshohn, J. Wolf, and P. Yu, \u201cScheduling parallel tasks to minimize average response time,\u201d in Proc. 5th SIAM Symp. on Discrete Algorithms, 1994b, pp. 112-121."},{"key":"5117214_CR27","doi-asserted-by":"crossref","unstructured":"Zahorjan, J. and C. McCann, \u201cProcessor scheduling in shared memory multiprocessors,\u201d in Proc. 1990 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Boulder, Colorado, May 1990, pp. 214-225.","DOI":"10.1145\/98457.98760"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022952324290.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022952324290\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022952324290.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:59:26Z","timestamp":1751633966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022952324290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["5117214"],"URL":"https:\/\/doi.org\/10.1023\/a:1022952324290","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}