{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:21Z","timestamp":1763467761065,"version":"3.33.0"},"reference-count":21,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2006,11]]},"abstract":"<jats:p> Effective communication between user and scheduler is an important prerequisite to achieving a successful scheuling outcome from both parties' perspectives. In a grid or stand-alone high-performance computing (HPC) enviroment, this communication typically takes the form of a user-provided job script containing essential configuration information, including processors\/resources required, a requested runtime, and a priority. Users' requested runtimes are notoriously inaccurate as a predictor of actual runimes. This study examines whether users can improve their runtime estimates if a tangible reward is provided for accuracy. We show that under these conditions, about half of users provide an improved estimate, but there is not a substantial improvement in the overall average accracy. Priority, as implemented in many production scheduers, is a very crude approximation of the value users may attach to timely job completion. We show users are capble of providing richer utility functions than most schedulers elicit. Thus we explore two elements of the user\u2013scheuler dialogue to understand if accuracy and completeness of information conveyed could be improved. <\/jats:p>","DOI":"10.1177\/1094342006068414","type":"journal-article","created":{"date-parts":[[2006,10,23]],"date-time":"2006-10-23T12:05:05Z","timestamp":1161605105000},"page":"495-506","source":"Crossref","is-referenced-by-count":37,"title":["On the User\u2013Scheduler Dialogue: Studies of User-Provided Runtime                 Estimates and Utility Functions"],"prefix":"10.1177","volume":"20","author":[{"given":"Cynthia Bailey","family":"Lee","sequence":"first","affiliation":[]},{"given":"Allan","family":"Snavely","sequence":"additional","affiliation":[{"name":"San Diego Supercomputer Center, University of California, San Diego"}]}],"member":"179","published-online":{"date-parts":[[2006,11,1]]},"reference":[{"issue":"1","key":"atypb1","volume":"92","author":"Buehler, R.","year":"2003","journal-title":"Orgaizational Behavior & Human Decision Processes"},{"volume-title":"Proceedings of the 4th Workshop on Workload Characterization","author":"Chiang, S.-H.","key":"atypb2"},{"key":"atypb3","unstructured":"Chun, B. N. 2001. Market-based Cluster Resource Managment. Ph.D. thesis.\n                University of California, Berkeley. November."},{"volume-title":"2nd IEEE International Symposium on Cluster Computing and the Grid","author":"Chun, B. N.","key":"atypb4"},{"volume-title":"Proceedings of IEEE 4th Annual Workshop on Job Scheduling Strategies for Paralel Processing","author":"Cirne, W.","key":"atypb5"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39997-6"},{"issue":"3","key":"atypb7","volume":"39","author":"Franaszek, P. A.","year":"1995","journal-title":"Journal of Research and Development"},{"volume-title":"13th IEEE International Symposium on High Performance Distriuted Computing","author":"Irwin, D. E.","key":"atypb8"},{"volume-title":"Proceedings of the 5th Workshop on Job Scheuling Strategies for Parallel Processing","author":"Jones, J. P.","key":"atypb9"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1037\/0022-3514.77.6.1121"},{"volume-title":"Proceedings of 8th Workshop on Job Scheduling Strategies for Parallel Processing","author":"Lawson, B. G.","key":"atypb11"},{"volume-title":"San Diego Supercomputer Center Tecnical Report","year":"2004","author":"Lee, C.","key":"atypb12"},{"issue":"7","key":"atypb13","volume":"81","author":"Lovallo, D.","year":"2003","journal-title":"Harvard Business Review"},{"issue":"1","key":"atypb14","volume":"1","author":"Messina, P. C.","year":"1993","journal-title":"Parallel & Distributed Technology"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1109\/71.932708"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2000.10041"},{"volume-title":"Proceedings of the 2002 ACM\/ IEEE Conference on Supercomputing","author":"Snavely, A.","key":"atypb17"},{"volume-title":"Proceedings of 2002 International Workshops on Parallel Processing","author":"Srinivasan, S.","key":"atypb18"},{"volume-title":"IPPS'95 Worshop: Job Scheduling Strategies for Parallel Processing","author":"Stoica, I.","key":"atypb19"},{"volume-title":"Proceedings of the 8th Workshop on Job Scheduling Strategies for Parallel Processing","author":"Ward, W. A. Jr.","key":"atypb20"},{"volume-title":"8th IEEE International Symposium on High Peformance Distributed Computing","author":"Zotkin, D.","key":"atypb21"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342006068414","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342006068414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T13:37:13Z","timestamp":1738071433000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342006068414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["10.1177\/1094342006068414"],"URL":"https:\/\/doi.org\/10.1177\/1094342006068414","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2006,11]]}}}