{"id":"https://openalex.org/W2165883910","doi":"https://doi.org/10.1002/cpe.4330020104","title":"The schedule parallel programming package with recycling job queues and iterated dependency graphs","display_name":"The schedule parallel programming package with recycling job queues and iterated dependency graphs","publication_year":1990,"publication_date":"1990-03-01","ids":{"openalex":"https://openalex.org/W2165883910","doi":"https://doi.org/10.1002/cpe.4330020104","mag":"2165883910"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330020104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330020104","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","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/A5089228130","display_name":"Floyd B. Hanson","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. B. Hanson","raw_affiliation_strings":["Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago P. O. Box 4348 Chicago, IL 60680, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago P. O. Box 4348 Chicago, IL 60680, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109866106","display_name":"D. C. Sorensen","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. C. Sorensen","raw_affiliation_strings":["Department of Mathematical Sciences Rice University P. O. Box 1892 Houston, TX 77251, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences Rice University P. O. Box 1892 Houston, TX 77251, USA","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089228130"],"corresponding_institution_ids":["https://openalex.org/I39422238"],"apc_list":null,"apc_paid":null,"fwci":0.9845,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81938821,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"1","first_page":"33","last_page":"53"},"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.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"}},"topics":[{"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.998199999332428,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9872000217437744,"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.7512661218643188},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.731681227684021},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6658891439437866},{"id":"https://openalex.org/keywords/queue-management-system","display_name":"Queue management system","score":0.5613259077072144},{"id":"https://openalex.org/keywords/job-queue","display_name":"Job queue","score":0.5541759729385376},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5432423949241638},{"id":"https://openalex.org/keywords/multilevel-queue","display_name":"Multilevel queue","score":0.5374202728271484},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.5372512340545654},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.43718069791793823},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.43453043699264526},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.43159496784210205},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.4283903241157532},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.4084286093711853},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37460052967071533},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33072954416275024},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3141177296638489},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24260863661766052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1695084571838379},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.13666576147079468},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12023371458053589},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10651364922523499}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7512661218643188},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.731681227684021},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6658891439437866},{"id":"https://openalex.org/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.5613259077072144},{"id":"https://openalex.org/C171627638","wikidata":"https://www.wikidata.org/wiki/Q6206744","display_name":"Job queue","level":4,"score":0.5541759729385376},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5432423949241638},{"id":"https://openalex.org/C201511382","wikidata":"https://www.wikidata.org/wiki/Q16801758","display_name":"Multilevel queue","level":4,"score":0.5374202728271484},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.5372512340545654},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.43718069791793823},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.43453043699264526},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.43159496784210205},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.4283903241157532},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.4084286093711853},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37460052967071533},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33072954416275024},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3141177296638489},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24260863661766052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1695084571838379},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.13666576147079468},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12023371458053589},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10651364922523499},{"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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.4330020104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330020104","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5199999809265137,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W11214786","https://openalex.org/W1533942910","https://openalex.org/W1537293292","https://openalex.org/W1542147302","https://openalex.org/W1551170326","https://openalex.org/W1555961351","https://openalex.org/W1734912584","https://openalex.org/W1981334972","https://openalex.org/W1994464372","https://openalex.org/W1995991185","https://openalex.org/W2001130603","https://openalex.org/W2023563208","https://openalex.org/W2085596722","https://openalex.org/W2135736783"],"related_works":["https://openalex.org/W2401183800","https://openalex.org/W1488955381","https://openalex.org/W2735859668","https://openalex.org/W2927104664","https://openalex.org/W4385069207","https://openalex.org/W2154610196","https://openalex.org/W2363401310","https://openalex.org/W2031779232","https://openalex.org/W75345567","https://openalex.org/W2165883910"],"abstract_inverted_index":{"Abstract":[0],"The":[1,61,108,134,154],"SCHEDULE":[2,142,164,190],"parallel":[3],"programming":[4],"package":[5,33,191],"has":[6,41],"been":[7,42],"modified":[8],"so":[9],"that":[10,71,83,223],"many":[11],"more":[12],"total":[13,38],"processes":[14,26,222],"may":[15],"be":[16,226],"spawned":[17,221],"as":[18,20],"long":[19],"the":[21,28,32,36,47,52,57,75,84,88,94,98,104,111,125,130,139,152,172,186,189,201,205,217],"number":[22,162,218],"of":[23,31,87,97,113,124,141,174,180,188,204,219],"currently":[24,126],"active":[25],"satisfy":[27],"former":[29],"limits":[30],"rather":[34,146],"than":[35,147],"cumulative":[37],"number.":[39],"This":[40,183,208],"accomplished":[43],"principally":[44],"by":[45,197],"changing":[46],"queueing":[48],"system":[49],"for":[50,79,228],"both":[51],"job":[53,131,144,149,160],"parameter":[54,132],"queue":[55,89],"and":[56,82,194,199],"ready":[58],"jobs":[59,81],"queue.":[60,99,133],"original":[62],"linear":[63],"queues":[64,76],"are":[65,77],"converted":[66],"to":[67,93,192],"circular":[68],"queues,":[69],"in":[70,74,106,212,216],"finished":[72],"places":[73],"reused":[78],"new":[80,136],"physical":[85,95],"end":[86],"is":[90,110,138],"logically":[91],"connected":[92],"beginning":[96],"Two":[100],"additional":[101],"features":[102],"facilitate":[103],"change":[105],"queues.":[107],"first":[109],"implementation":[112],"a":[114,117,122,159,166,213],"third":[115],"queue,":[116],"free":[118,127],"list,":[119],"which":[120],"keeps":[121],"list":[123],"slots":[128],"on":[129],"second":[135],"feature":[137,209],"use":[140],"generated":[143],"tags":[145,150],"user\u2010generated":[148],"within":[151],"package.":[153],"user":[155],"program":[156],"now":[157],"gets":[158],"tag":[161],"from":[163],"with":[165,177],"subroutine":[167],"call.":[168],"Another":[169],"improvement":[170,184],"permits":[171],"iteration":[173],"dependency":[175,181,206],"graphs,":[176],"minimal":[178],"restoration":[179],"data.":[182],"facilitates":[185],"application":[187],"iterations":[193],"time\u2010stepping":[195],"problems,":[196],"saving":[198],"reusing":[200],"iterated":[202],"part":[203],"graph.":[207],"can":[210],"result":[211],"significant":[214],"reduction":[215],"newly":[220],"would":[224],"otherwise":[225],"needed":[227],"iterations.":[229]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}