{"id":"https://openalex.org/W2126519254","doi":"https://doi.org/10.1109/clustr.2008.4663793","title":"Empirical-based probabilistic upper bounds for urgent computing applications","display_name":"Empirical-based probabilistic upper bounds for urgent computing applications","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2126519254","doi":"https://doi.org/10.1109/clustr.2008.4663793","mag":"2126519254"},"language":"en","primary_location":{"id":"doi:10.1109/clustr.2008.4663793","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clustr.2008.4663793","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Cluster Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016245209","display_name":"Nick Trebon","orcid":null},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nick Trebon","raw_affiliation_strings":["Computer Science Department, University of Chicago, Chicago, IL, USA","Comput. Sci. Dept., Univ. of Chicago, Chicago, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"Comput. Sci. Dept., Univ. of Chicago, Chicago, IL","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038177319","display_name":"Pete Beckman","orcid":"https://orcid.org/0000-0002-9428-7801"},"institutions":[{"id":"https://openalex.org/I1282105669","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282105669","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pete Beckman","raw_affiliation_strings":["Argonne National Laboratory, Argonne, IL, USA","Argonne National Lab, Argonne IL#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Argonne National Laboratory, Argonne, IL, USA","institution_ids":["https://openalex.org/I1282105669"]},{"raw_affiliation_string":"Argonne National Lab, Argonne IL#TAB#","institution_ids":["https://openalex.org/I1282105669"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2546,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.45464477,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":null,"first_page":"342","last_page":"347"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8224778175354004},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6732357144355774},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.666791558265686},{"id":"https://openalex.org/keywords/grid-computing","display_name":"Grid computing","score":0.5868327021598816},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5690651535987854},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.5412966012954712},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.498337984085083},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.49232184886932373},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.4815254807472229},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48078101873397827},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.4377669394016266},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.43252843618392944},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4190680980682373},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.38808003067970276},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10510283708572388}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8224778175354004},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6732357144355774},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.666791558265686},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.5868327021598816},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5690651535987854},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5412966012954712},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.498337984085083},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.49232184886932373},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4815254807472229},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48078101873397827},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.4377669394016266},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.43252843618392944},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4190680980682373},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.38808003067970276},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10510283708572388},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/clustr.2008.4663793","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clustr.2008.4663793","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Cluster Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.582.5841","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.582.5841","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://spruce.uchicago.edu/papers/cluster08.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5400000214576721,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309626","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W31551343","https://openalex.org/W2014159082","https://openalex.org/W2059141234","https://openalex.org/W2070968529","https://openalex.org/W2126020875","https://openalex.org/W2163242245","https://openalex.org/W6601286018","https://openalex.org/W6684272951"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W2148520865","https://openalex.org/W189328514","https://openalex.org/W2143289692","https://openalex.org/W3049636605","https://openalex.org/W1974858599"],"abstract_inverted_index":{"Scientific":[0],"simulation":[1],"and":[2,20,65,162],"modeling":[3],"often":[4],"aid":[5],"in":[6,10,192],"making":[7],"critical":[8],"decisions":[9],"such":[11],"diverse":[12],"fields":[13],"as":[14,58,60],"city":[15],"planning,":[16],"severe":[17],"weather":[18],"prediction":[19],"influenza":[21],"modeling.":[22],"In":[23,44],"some":[24,107],"of":[25,47,134,150,160],"these":[26,45,54,76],"situations":[27],"the":[28,37,122,126,132,147,173,190],"computations":[29,55,79],"operate":[30],"under":[31],"strict":[32],"deadlines,":[33],"after":[34],"which":[35,139],"point":[36],"results":[38],"may":[39,108,114],"have":[40],"very":[41],"little":[42],"value.":[43],"cases":[46],"urgent":[48,66,103,143,179],"computing,":[49],"it":[50],"is":[51,70,128],"imperative":[52],"that":[53,199],"begin":[56],"execution":[57],"quickly":[59,81],"possible.":[61],"The":[62],"special":[63],"priority":[64,78],"compute":[67],"environment":[68],"(SPRUCE)":[69],"a":[71,152,158,194],"framework":[72],"designed":[73],"to":[74,80,96,100,102,119,188],"enable":[75],"high":[77],"access":[82],"computational":[83],"grid":[84],"resources":[85,93],"through":[86],"elevated":[87],"batch":[88],"queue":[89],"priority.":[90],"However,":[91,125],"participating":[92],"are":[94],"allowed":[95],"decide":[97],"locally":[98],"how":[99],"respond":[101],"requests.":[104],"For":[105],"instance,":[106],"offer":[109],"next-to-run":[110],"status":[111],"while":[112],"others":[113],"preempt":[115],"currently":[116],"executing":[117],"jobs":[118],"clear":[120],"off":[121],"necessary":[123],"nodes.":[124],"user":[127,191],"still":[129],"faced":[130],"with":[131,196],"problem":[133],"resource":[135,140,195],"selection":[136],"-":[137],"namely,":[138],"(and":[141],"corresponding":[142],"computing":[144],"policy)":[145],"provides":[146],"best":[148],"probability":[149],"meeting":[151],"given":[153],"deadline?":[154],"This":[155],"paper":[156],"introduces":[157],"set":[159],"methodologies":[161],"heuristics":[163],"aimed":[164],"at":[165],"generating":[166],"an":[167,178],"empirical-based":[168],"probabilistic":[169],"upper":[170,182],"bound":[171],"on":[172],"total":[174],"turnaround":[175],"time":[176],"for":[177],"computation.":[180],"These":[181],"bounds":[183],"can":[184],"then":[185],"be":[186,203],"used":[187],"guide":[189],"selecting":[193],"greater":[197],"confidence":[198],"their":[200],"deadline":[201],"will":[202],"met.":[204]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}