{"id":"https://openalex.org/W2030550230","doi":"https://doi.org/10.1093/comjnl/bxm059","title":"Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints","display_name":"Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints","publication_year":2007,"publication_date":"2007-08-29","ids":{"openalex":"https://openalex.org/W2030550230","doi":"https://doi.org/10.1093/comjnl/bxm059","mag":"2030550230"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxm059","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxm059","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},"type":"article","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/A5086413406","display_name":"K. Li","orcid":"https://orcid.org/0009-0005-6135-6662"},"institutions":[{"id":"https://openalex.org/I157455823","display_name":"SUNY New Paltz","ror":"https://ror.org/03j3dv688","country_code":"US","type":"education","lineage":["https://openalex.org/I157455823"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. Li","raw_affiliation_strings":["Department of Computer Science, State University of New York, New Paltz, New York 12561, USA","Department of Computer Science State University of New York New Paltz, New York 12561, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, New Paltz, New York 12561, USA","institution_ids":["https://openalex.org/I157455823"]},{"raw_affiliation_string":"Department of Computer Science State University of New York New Paltz, New York 12561, USA","institution_ids":["https://openalex.org/I157455823"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086413406"],"corresponding_institution_ids":["https://openalex.org/I157455823"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":0.7889,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78962953,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"51","issue":"2","first_page":"216","last_page":"226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T12176","display_name":"Optimization and Packing Problems","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7388242483139038},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6075044274330139},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.519869327545166},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33827051520347595},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10847461223602295},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10075047612190247}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7388242483139038},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6075044274330139},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.519869327545166},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33827051520347595},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10847461223602295},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10075047612190247}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/comjnl/bxm059","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxm059","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.421.1106","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.1106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cecs.uci.edu/~papers/ipdps07/pdfs/PMEO-PDS-01-paper-1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1541480673","https://openalex.org/W1605529813","https://openalex.org/W1606760325","https://openalex.org/W1971197709","https://openalex.org/W2024742034","https://openalex.org/W2043862089","https://openalex.org/W2057392949","https://openalex.org/W2058989830","https://openalex.org/W2104680817","https://openalex.org/W2127960094"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2025955409","https://openalex.org/W1986410062","https://openalex.org/W4231062255"],"abstract_inverted_index":{"We":[0,19,92],"evaluate":[1],"the":[2,36,39,64,83,99,126],"average-case":[3,48,89,100],"performance":[4,49,90,101,114],"of":[5,13,25,51,66,72,85,102,139],"three":[6],"approximation":[7],"algorithms":[8,106],"for":[9,22],"online":[10,40,103],"non-clairvoyant":[11,41,104],"scheduling":[12,42,105],"parallel":[14],"tasks":[15,124],"with":[16],"precedence":[17],"constraints.":[18],"show":[20],"that":[21],"a":[23,137],"class":[24],"wide":[26],"task":[27,30,73],"graphs,":[28],"when":[29],"sizes":[31],"are":[32],"uniformly":[33],"distributed":[34],"in":[35,125],"range":[37],"[1\u2026C],":[38],"algorithm":[43,120],"LL-SIMPLE":[44,116],"has":[45,112],"an":[46,118],"asymptotic":[47,88],"bound":[50],"M/(M":[52],"\u2212":[53,55,59],"(3":[54],"(1":[56],"+":[57],"1/C)C+1)C":[58],"1),":[60],"where":[61],"M":[62],"is":[63],"number":[65],"processors.":[67],"For":[68],"uniform":[69],"probability":[70],"distributions":[71],"sizes,":[74],"we":[75],"present":[76],"numerical":[77],"and":[78,108],"simulation":[79],"data":[80],"to":[81,121,136],"demonstrate":[82],"accuracy":[84],"our":[86],"general":[87],"bound.":[91],"also":[93],"report":[94],"extensive":[95],"experimental":[96],"results":[97],"on":[98],"LL-GREEDY":[107,111],"LS.":[109],"Algorithm":[110,129],"better":[113,133],"than":[115],"using":[117],"improved":[119],"schedule":[122],"independent":[123],"same":[127],"level.":[128],"LS":[130],"produces":[131],"even":[132],"schedules":[134],"due":[135],"break":[138],"boundaries":[140],"among":[141],"levels.":[142]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}