{"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","alternate_titles":[],"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","doi":"https://doi.org/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,"listed_in":["ccf-b","cwts-core","dongbi-b","jufo-2","norway-1","poland-70","russia-white-list-3"],"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"},"parent_works":[],"lineage":["https://openalex.org/W2136015016"],"child_works_count":0,"type":"article","is_traditional":true,"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,"observed_orcids":[]},"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,"contributor_roles":[],"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":"Victor J. Rayward-Smith","orcid":"https://orcid.org/0000-0003-2432-853X","observed_orcids":["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,"contributor_roles":[],"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":{"value":2660,"currency":"USD","value_usd":2660},"apc_paid":null,"fwci":1.4607,"has_fulltext":true,"cited_by_count":9,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.81592735,"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_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.625,"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.625,"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/T10126","display_name":"Logic, programming, and type systems","score":0.28049999475479126,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.05270000174641609,"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/parallel-functional-languages","display_name":"parallel functional languages","score":0.6890000104904175},{"id":"https://openalex.org/keywords/process-migration","display_name":"task migration","score":0.5870000123977661},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"process scheduling","score":0.46399998664855957},{"id":"https://openalex.org/keywords/dynamic-process-creation","display_name":"dynamic process creation","score":0.6909999847412109},{"id":"https://openalex.org/keywords/process-synchronization","display_name":"process synchronization","score":0.7599999904632568},{"id":"https://openalex.org/keywords/sequential-processes","display_name":"sequential processes","score":0.6909999847412109},{"id":"https://openalex.org/keywords/local-memory","display_name":"local memory","score":0.45500001311302185}],"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","doi":"https://doi.org/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,"listed_in":["ccf-b","cwts-core","dongbi-b","jufo-2","norway-1","poland-70","russia-white-list-3"],"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","doi":null,"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,"listed_in":[],"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","doi":"https://doi.org/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,"listed_in":["ccf-b","cwts-core","dongbi-b","jufo-2","norway-1","poland-70","russia-white-list-3"],"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":[],"study_designs":[],"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/W2469249722","https://openalex.org/W2016224013","https://openalex.org/W7097152175","https://openalex.org/W2138906015","https://openalex.org/W2060847221","https://openalex.org/W3105968930","https://openalex.org/W1813804892","https://openalex.org/W1568006413","https://openalex.org/W4248901744","https://openalex.org/W2745589267"],"abstract_inverted_index":{"Many":[0],"of":[1,34,41,51],"the":[2,18,32,39,47,60,94,100],"details":[3],"that":[4,67,77,129,154],"a":[5,12,21,25,52,68,137,169],"programmer":[6],"must":[7,133],"manage":[8],"when":[9],"programming":[10],"in":[11,20,81,93,191],"procedural":[13],"language":[14],"are":[15,91,158],"handled":[16,45,58],"by":[17,46,59,99],"implementation":[19,61],"functional":[22,27,70],"language.":[23],"In":[24],"parallel":[26,69,103],"language,":[28],"we":[29],"would":[30],"expect":[31],"assignment":[33],"processes":[35,42,55,74,78,90,119,157,160],"to":[36,43,117,124],"processors":[37],"and":[38,76,167],"scheduling":[40,144],"be":[44,57,134,172,187],"implementation.":[48,101],"The":[49],"partitioning":[50],"program":[53,71,96],"into":[54],"may":[56,72,79,171],"as":[62],"well.":[63],"We":[64,126,150],"will":[65,127,152],"assume":[66],"create":[73],"dynamically,":[75],"synchronize":[80],"an":[82],"arbitrary":[83],"manner.":[84],"It":[85],"does":[86],"not":[87,116,163],"matter":[88],"whether":[89],"defined":[92],"source":[95],"or":[97],"generated":[98],"On":[102],"systems":[104],"where":[105],"each":[106,131],"processor":[107],"has":[108],"some":[109],"local":[110],"memory,":[111],"it":[112,175],"is":[113],"common":[114],"practice":[115],"move":[118],"once":[120],"they":[121],"have":[122],"started":[123],"execute.":[125],"show":[128,153],"if":[130,155,168],"process":[132,170],"executed":[135],"on":[136],"single":[138],"processor,":[139],"then":[140,183],"no":[141],"fully":[142],"automatic":[143],"strategy":[145],"can":[146,186],"ensure":[147],"good":[148,184],"performance.":[149],"also":[151],"all":[156],"sequential":[159],"(i.e.":[161],"do":[162],"contain":[164],"internal":[165],"parallelism),":[166],"moved":[173],"whenever":[174],"resumes":[176],"execution":[177],"following":[178],"synchronization":[179],"with":[180],"another":[181],"process,":[182],"performance":[185],"assured,":[188],"at":[189],"least":[190],"theory.":[192]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2136015016","counts_by_year":[],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
