{"id":"https://openalex.org/W2038841620","doi":"https://doi.org/10.1142/s0129054101000850","title":"AN EFFICIENT JOB SCHEDULING ALGORITHM IN PARTITIONABLE MESH CONNECTED SYSTEMS","display_name":"AN EFFICIENT JOB SCHEDULING ALGORITHM IN PARTITIONABLE MESH CONNECTED SYSTEMS","publication_year":2001,"publication_date":"2001-12-01","ids":{"openalex":"https://openalex.org/W2038841620","doi":"https://doi.org/10.1142/s0129054101000850","mag":"2038841620"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054101000850","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054101000850","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5087894632","display_name":"Keqin Li","orcid":"https://orcid.org/0000-0001-5224-4048"},"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":"KEQIN LI","raw_affiliation_strings":["Department of Computer Science, State University of New York, New Paltz, New York 12561, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, New Paltz, New York 12561, U.S.A","institution_ids":["https://openalex.org/I157455823"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087894632"],"corresponding_institution_ids":["https://openalex.org/I157455823"],"apc_list":null,"apc_paid":null,"fwci":0.6628,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.79933403,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"06","first_page":"763","last_page":"773"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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.9991000294685364,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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/independent-and-identically-distributed-random-variables","display_name":"Independent and identically distributed random variables","score":0.74770587682724},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6543574333190918},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.615119218826294},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6146966814994812},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5505960583686829},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4944489002227783},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.44517242908477783},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.43682217597961426},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38203224539756775},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37344104051589966},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36086639761924744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.340212881565094},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.3251705765724182},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.3021214008331299},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2956482172012329},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.2895302176475525},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.2608989179134369},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06713521480560303}],"concepts":[{"id":"https://openalex.org/C141513077","wikidata":"https://www.wikidata.org/wiki/Q378542","display_name":"Independent and identically distributed random variables","level":3,"score":0.74770587682724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6543574333190918},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.615119218826294},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6146966814994812},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5505960583686829},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4944489002227783},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.44517242908477783},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.43682217597961426},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38203224539756775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37344104051589966},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36086639761924744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.340212881565094},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.3251705765724182},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.3021214008331299},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2956482172012329},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2895302176475525},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2608989179134369},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06713521480560303},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054101000850","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054101000850","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1980774736","https://openalex.org/W1989028842","https://openalex.org/W2009489504","https://openalex.org/W2018249079","https://openalex.org/W2024742034","https://openalex.org/W2043862089","https://openalex.org/W2067297441","https://openalex.org/W2081987145","https://openalex.org/W2117787693","https://openalex.org/W2154305205"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W4386580182","https://openalex.org/W2106332846","https://openalex.org/W2369829641","https://openalex.org/W2172075652","https://openalex.org/W2545511463","https://openalex.org/W2167842822","https://openalex.org/W7935161","https://openalex.org/W2372879566","https://openalex.org/W2168594051"],"abstract_inverted_index":{"In":[0,48],"this":[1],"paper,":[2],"we":[3,50],"consider":[4],"the":[5,23,54,72,85,107],"problem":[6,17,26],"of":[7,56,87],"scheduling":[8,25],"independent":[9,62],"jobs":[10,33,60,131],"in":[11,71],"partitionable":[12,89],"mesh":[13,90],"connected":[14,91],"systems.":[15],"The":[16,124],"is":[18,84,117],"NP-hard,":[19],"since":[20],"it":[21],"includes":[22],"multiprocessor":[24],"as":[27],"a":[28,40,88],"special":[29],"case":[30],"when":[31,130],"all":[32],"request":[34,132],"for":[35,133],"one":[36],"processor.":[37],"We":[38],"analyze":[39],"simple":[41],"approximation":[42],"algorithm":[43],"called":[44],"A":[45,112],"m":[46,113],".":[47],"particular,":[49],"show":[51],"that":[52],"if":[53],"sizes":[55],"submeshes":[57,135],"requested":[58],"by":[59,122],"are":[61,97],"and":[63,93,104],"identically":[64],"distributed":[65,70],"(i.i.d.)":[66],"random":[67,99],"variables":[68,100],"uniformly":[69],"range":[73],"[1..M":[74],"1":[75,81],"]\u00d7[1..M":[76],"2":[77,83],"],":[78],"where":[79],"M":[80],"\u00d7M":[82],"size":[86],"system,":[92],"task":[94],"execution":[95],"times":[96],"i.i.d.":[98],"with":[101],"finite":[102],"mean":[103],"variance,":[105],"then":[106],"average-case":[108,125],"performance":[109,126],"ratio":[110,127],"E(":[111],"(L))/E(":[114],"OPT":[115],"(L))":[116],"asymptotically":[118],"bounded":[119],"from":[120],"above":[121],"1.6637594\u2026.":[123],"improves":[128],"significantly":[129],"square":[134],"or":[136],"small":[137],"submeshes.":[138]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}