{"id":"https://openalex.org/W2098711189","doi":"https://doi.org/10.1080/10637199508915517","title":"A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS","display_name":"A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2098711189","doi":"https://doi.org/10.1080/10637199508915517","mag":"2098711189"},"language":"en","primary_location":{"id":"doi:10.1080/10637199508915517","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199508915517","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5056037815","display_name":"M\u00fcslim Bozyi\u011fit","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"MUSLIM BOZYIGIT","raw_affiliation_strings":["University of Cambridge, Computer Laboratory, New Museums Site, Cambridge, CB2 3QG, UK","University of Cambridge, Computer Laboratory , New Museums Site, Cambridge, CB2 3QG, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cambridge, Computer Laboratory, New Museums Site, Cambridge, CB2 3QG, UK","institution_ids":["https://openalex.org/I241749"]},{"raw_affiliation_string":"University of Cambridge, Computer Laboratory , New Museums Site, Cambridge, CB2 3QG, UK","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026763232","display_name":"Amin A. Abdulghani","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I4210096112","display_name":"Rutgers Sexual and Reproductive Health and Rights","ror":"https://ror.org/00rcvgx40","country_code":"NL","type":"other","lineage":["https://openalex.org/I4210096112"]}],"countries":["NL","US"],"is_corresponding":false,"raw_author_name":"AMIN A. ABDULGHANI","raw_affiliation_strings":["Rutgers University, Computer Science Department, NJ, USA","Rutgers University, Computer Science Department , NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, Computer Science Department, NJ, USA","institution_ids":["https://openalex.org/I102322142","https://openalex.org/I4210096112"]},{"raw_affiliation_string":"Rutgers University, Computer Science Department , NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27076278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"4","first_page":"303","last_page":"316"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T10715","display_name":"Distributed and Parallel Computing Systems","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/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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.774786651134491},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.646766185760498},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5589475035667419},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.49424436688423157},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4942317306995392},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.49103403091430664},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.48635321855545044},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4255075454711914},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42302852869033813},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19323867559432983},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1308743953704834},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06814634799957275}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.774786651134491},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.646766185760498},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5589475035667419},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.49424436688423157},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4942317306995392},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.49103403091430664},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.48635321855545044},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4255075454711914},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42302852869033813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19323867559432983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1308743953704834},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06814634799957275},{"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.1080/10637199508915517","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199508915517","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1829003113","https://openalex.org/W2019356799","https://openalex.org/W2025896589","https://openalex.org/W2040877664","https://openalex.org/W2045421223","https://openalex.org/W2051249422","https://openalex.org/W2065689629","https://openalex.org/W2071680704","https://openalex.org/W2079697168","https://openalex.org/W2080084865","https://openalex.org/W2092333800","https://openalex.org/W2111249406","https://openalex.org/W2151297797","https://openalex.org/W2226625680"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W3003077338","https://openalex.org/W2225350526","https://openalex.org/W1545991362","https://openalex.org/W3036719625"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"a":[3,9,29,50,58,97],"parallel":[4,19,75],"scheduling":[5,8,76],"algorithm":[6,40,67,77],"for":[7,49],"set":[10],"of":[11,65],"n":[12,70,91],"partially":[13],"ordered":[14],"tasks":[15],"on":[16,28,57],"an":[17,35,43],"m-processor":[18],"computing":[20],"system":[21,53],"is":[22,26,42,47,55,68,88],"studied.":[23],"The":[24,62,74],"method":[25],"based":[27,60],"conventional":[30],"list":[31],"scheduling,":[32],"in":[33,96],"particular,":[34],"earliest-task-first":[36],"approach.":[37],"Otherwise,":[38],"the":[39,66,79],"developed":[41],"original":[44],"algorithm.":[45],"It":[46],"designed":[48],"hypercube":[51],"type":[52],"and":[54],"tested":[56],"Transputer":[59],"environment,":[61],"time":[63],"complexity":[64,87],"O(n(log":[69],"+":[71,92],"log":[72,93],"m)).":[73],"produces":[78],"same":[80],"schdules":[81],"as":[82],"its":[83],"sequential":[84],"counterpart":[85],"whose":[86],"O(mn":[89],"2(log":[90],"m)),":[94],"but":[95],"shorter":[98],"time.":[99]},"counts_by_year":[],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}