{"id":"https://openalex.org/W2166767748","doi":"https://doi.org/10.1109/tpds.2003.1247678","title":"On approximation of the bulk synchronous task scheduling problem","display_name":"On approximation of the bulk synchronous task scheduling problem","publication_year":2003,"publication_date":"2003-11-01","ids":{"openalex":"https://openalex.org/W2166767748","doi":"https://doi.org/10.1109/tpds.2003.1247678","mag":"2166767748"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2003.1247678","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2003.1247678","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","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/A5018083376","display_name":"Nariaki Fujimoto","orcid":"https://orcid.org/0000-0002-8570-4001"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"N. Fujimoto","raw_affiliation_strings":["School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111729293","display_name":"Kenichi Hagihara","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K. Hagihara","raw_affiliation_strings":["School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Osaka University, Toyonaka, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.25470929,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"14","issue":"11","first_page":"1191","last_page":"1199"},"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.9998999834060669,"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.9998999834060669,"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.9984999895095825,"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.9959999918937683,"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.7685831189155579},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7155427932739258},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.623049259185791},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6090939044952393},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.47626492381095886},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4268852174282074},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.41629576683044434},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4137084484100342},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.41117575764656067},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37905487418174744},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36924314498901367},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27694863080978394},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13496160507202148},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05820363759994507}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7685831189155579},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7155427932739258},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.623049259185791},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6090939044952393},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.47626492381095886},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4268852174282074},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.41629576683044434},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4137084484100342},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.41117575764656067},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37905487418174744},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36924314498901367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27694863080978394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13496160507202148},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05820363759994507},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"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/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tpds.2003.1247678","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2003.1247678","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.4766","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.4766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-hagi.ist.osaka-u.ac.jp/~fujimoto/publications/tpds2003.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.8299999833106995}],"awards":[],"funders":[{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W20811953","https://openalex.org/W1517653283","https://openalex.org/W1534741631","https://openalex.org/W1556795228","https://openalex.org/W1706052126","https://openalex.org/W1808396869","https://openalex.org/W1870143573","https://openalex.org/W1973797056","https://openalex.org/W1983770018","https://openalex.org/W1989582918","https://openalex.org/W1991906005","https://openalex.org/W1998978603","https://openalex.org/W2041407472","https://openalex.org/W2045271686","https://openalex.org/W2049890071","https://openalex.org/W2057392949","https://openalex.org/W2057461902","https://openalex.org/W2074762232","https://openalex.org/W2075312227","https://openalex.org/W2078031780","https://openalex.org/W2098135206","https://openalex.org/W2110417760","https://openalex.org/W2111729549","https://openalex.org/W2118396891","https://openalex.org/W2150446509","https://openalex.org/W2155951254","https://openalex.org/W2158923044","https://openalex.org/W2159644278","https://openalex.org/W2169560887","https://openalex.org/W2169878774","https://openalex.org/W2170368487","https://openalex.org/W3041581902","https://openalex.org/W4285719527","https://openalex.org/W6600853588","https://openalex.org/W6633091883","https://openalex.org/W6780575706"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909","https://openalex.org/W1781596060","https://openalex.org/W2151588880","https://openalex.org/W2579119907","https://openalex.org/W2116365123","https://openalex.org/W2140213052","https://openalex.org/W4300941567","https://openalex.org/W2484276552"],"abstract_inverted_index":{"The":[0],"bulk":[1],"synchronous":[2],"task":[3,12],"scheduling":[4,13],"problem":[5,14],"(BSSPO)":[6],"is":[7,49],"known":[8],"as":[9],"an":[10,66],"effective":[11],"for":[15,75],"distributed":[16],"memory":[17],"machines.":[18],"We":[19,63],"present":[20],"a":[21,70],"proof":[22],"of":[23,25,29,35,37,44,73],"NP-completeness":[24],"the":[26,33],"decision":[27],"counterpart":[28],"BSSPO,":[30,45],"even":[31],"in":[32,77],"case":[34],"makespan":[36],"at":[38],"most":[39],"five.":[40],"This":[41],"implies":[42],"nonapproximability":[43],"meaning":[46],"that":[47],"there":[48],"no":[50],"approximation":[51,67],"algorithm":[52,68],"with":[53,69],"performance":[54,71],"guarantee":[55,72],"smaller":[56],"than":[57],"6/5":[58],"unless":[59],"P":[60],"=":[61],"NP.":[62],"also":[64],"give":[65],"two":[74],"BSSPO":[76],"several":[78],"restricted":[79],"cases.":[80]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}