{"id":"https://openalex.org/W2136015016","doi":"https://doi.org/10.1017/s0956796800000940","title":"Worst case scheduling for parallel functional programs","display_name":"Worst case scheduling for parallel functional programs","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2136015016","doi":"https://doi.org/10.1017/s0956796800000940","mag":"2136015016"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796800000940","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000940","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9A0ED3A53A5EBEED1D4900F718E892C4/S0956796800000940a.pdf/div-class-title-worst-case-scheduling-for-parallel-functional-programs-a-href-fn01-ref-type-fn-span-class-sup-1-span-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9A0ED3A53A5EBEED1D4900F718E892C4/S0956796800000940a.pdf/div-class-title-worst-case-scheduling-for-parallel-functional-programs-a-href-fn01-ref-type-fn-span-class-sup-1-span-a-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067382904","display_name":"F. Warren Burton","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"F. Warren Burton","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, British Columbia, CanadaV5A 1S6 (e-mail:","Simon Fraser University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, British Columbia, CanadaV5A 1S6 (e-mail:","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"Simon Fraser University","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003354242","display_name":"V. J. Rayward\u2010Smith","orcid":"https://orcid.org/0000-0003-2432-853X"},"institutions":[{"id":"https://openalex.org/I1118541","display_name":"University of East Anglia","ror":"https://ror.org/026k5mg93","country_code":"GB","type":"education","lineage":["https://openalex.org/I1118541"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"V. J. Rayward-Smith","raw_affiliation_strings":["School of Information Systems, University of East Anglia, Norwich NR4 7TJ, UK (e-mail:","#N#University of East Anglia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Systems, University of East Anglia, Norwich NR4 7TJ, UK (e-mail:","institution_ids":["https://openalex.org/I1118541"]},{"raw_affiliation_string":"#N#University of East Anglia","institution_ids":["https://openalex.org/I1118541"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7647,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86160714,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"1","first_page":"65","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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/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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9986000061035156,"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.9370983839035034},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.6923031806945801},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6114712357521057},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5779834985733032},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4985160827636719},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.45832359790802},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42622295022010803},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.42122000455856323},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4144042134284973}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9370983839035034},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.6923031806945801},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6114712357521057},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5779834985733032},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4985160827636719},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.45832359790802},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42622295022010803},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.42122000455856323},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4144042134284973},{"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0956796800000940","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000940","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9A0ED3A53A5EBEED1D4900F718E892C4/S0956796800000940a.pdf/div-class-title-worst-case-scheduling-for-parallel-functional-programs-a-href-fn01-ref-type-fn-span-class-sup-1-span-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:ueaeprints.uea.ac.uk:3026","is_oa":false,"landing_page_url":"https://ueaeprints.uea.ac.uk/id/eprint/3026/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400384","display_name":"UEA Digital Repository (University of East Anglia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1118541","host_organization_name":"University of East Anglia","host_organization_lineage":["https://openalex.org/I1118541"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1017/s0956796800000940","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800000940","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9A0ED3A53A5EBEED1D4900F718E892C4/S0956796800000940a.pdf/div-class-title-worst-case-scheduling-for-parallel-functional-programs-a-href-fn01-ref-type-fn-span-class-sup-1-span-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309552","display_name":"University of Tulsa","ror":"https://ror.org/04wn28048"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2136015016.pdf","grobid_xml":"https://content.openalex.org/works/W2136015016.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W1976299735","https://openalex.org/W2022049964","https://openalex.org/W2051586165","https://openalex.org/W2077163592","https://openalex.org/W2125144506","https://openalex.org/W2135490589"],"related_works":["https://openalex.org/W2379153735","https://openalex.org/W2046172023","https://openalex.org/W2972896947","https://openalex.org/W2170146914","https://openalex.org/W2355105570","https://openalex.org/W2083974823","https://openalex.org/W2072751097","https://openalex.org/W2015567081","https://openalex.org/W4237177615","https://openalex.org/W2289257917"],"abstract_inverted_index":{"Abstract":[0],"Many":[1],"of":[2,35,42,52],"the":[3,19,33,40,48,61,95,101],"details":[4],"that":[5,68,78,130,155],"a":[6,13,22,26,53,69,138,170],"programmer":[7],"must":[8,134],"manage":[9],"when":[10],"programming":[11],"in":[12,21,82,94,192],"procedural":[14],"language":[15],"are":[16,92,159],"handled":[17,46,59],"by":[18,47,60,100],"implementation":[20,62],"functional":[23,28,71],"language.":[24],"In":[25],"parallel":[27,70,104],"language,":[29],"we":[30],"would":[31],"expect":[32],"assignment":[34],"processes":[36,43,56,75,79,91,120,158,161],"to":[37,44,118,125],"processors":[38],"and":[39,77,168],"scheduling":[41,145],"be":[45,58,135,173,188],"implementation.":[49,102],"The":[50],"partitioning":[51],"program":[54,72,97],"into":[55],"may":[57,73,80,172],"as":[63],"well.":[64],"We":[65,127,151],"will":[66,128,153],"assume":[67],"create":[74],"dynamically,":[76],"synchronize":[81],"an":[83],"arbitrary":[84],"manner.":[85],"It":[86],"does":[87],"not":[88,117,164],"matter":[89],"whether":[90],"defined":[93],"source":[96],"or":[98],"generated":[99],"On":[103],"systems":[105],"where":[106],"each":[107,132],"processor":[108],"has":[109],"some":[110],"local":[111],"memory,":[112],"it":[113,176],"is":[114],"common":[115],"practice":[116],"move":[119],"once":[121],"they":[122],"have":[123],"started":[124],"execute.":[126],"show":[129,154],"if":[131,156,169],"process":[133,171],"executed":[136],"on":[137],"single":[139],"processor,":[140],"then":[141,184],"no":[142],"fully":[143],"automatic":[144],"strategy":[146],"can":[147,187],"ensure":[148],"good":[149,185],"performance.":[150],"also":[152],"all":[157],"sequential":[160],"(i.e.":[162],"do":[163],"contain":[165],"internal":[166],"parallelism),":[167],"moved":[174],"whenever":[175],"resumes":[177],"execution":[178],"following":[179],"synchronization":[180],"with":[181],"another":[182],"process,":[183],"performance":[186],"assured,":[189],"at":[190],"least":[191],"theory.":[193]},"counts_by_year":[],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}