{"id":"https://openalex.org/W4256335355","doi":"https://doi.org/10.1109/pact.1999.807534","title":"Lower bounding techniques for the multiprocessor scheduling problem with communication delay","display_name":"Lower bounding techniques for the multiprocessor scheduling problem with communication delay","publication_year":2003,"publication_date":"2003-01-20","ids":{"openalex":"https://openalex.org/W4256335355","doi":"https://doi.org/10.1109/pact.1999.807534"},"language":"en","primary_location":{"id":"doi:10.1109/pact.1999.807534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact.1999.807534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"1999 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00425)","raw_type":"proceedings-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/A5087923932","display_name":"Satoshi Fujita","orcid":"https://orcid.org/0000-0001-9412-7309"},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"S. Fujita","raw_affiliation_strings":["Department of Electrical Engineering, Hiroshima University, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Hiroshima University, Japan","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089434144","display_name":"T. Nakagawa","orcid":null},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. Nakagawa","raw_affiliation_strings":["Department of Electrical Engineering, Hiroshima University, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Hiroshima University, Japan","institution_ids":["https://openalex.org/I113306721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087923932"],"corresponding_institution_ids":["https://openalex.org/I113306721"],"apc_list":null,"apc_paid":null,"fwci":0.7664,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.81440623,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":null,"first_page":"212","last_page":"220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9936000108718872,"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.9936000108718872,"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.9692000150680542,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9527999758720398,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.9002740979194641},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8152128458023071},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7399964332580566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7054155468940735},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6429967880249023},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.605330228805542},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.554502010345459},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5266846418380737},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4412149488925934},{"id":"https://openalex.org/keywords/retard","display_name":"Retard","score":0.4329811930656433},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.419761061668396},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.34803467988967896},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.26380568742752075},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25536924600601196},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24816706776618958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20797666907310486},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.06793814897537231},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.06640997529029846}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.9002740979194641},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8152128458023071},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7399964332580566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7054155468940735},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6429967880249023},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.605330228805542},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.554502010345459},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5266846418380737},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4412149488925934},{"id":"https://openalex.org/C2777131613","wikidata":"https://www.wikidata.org/wiki/Q18394147","display_name":"Retard","level":2,"score":0.4329811930656433},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.419761061668396},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.34803467988967896},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.26380568742752075},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25536924600601196},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24816706776618958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20797666907310486},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.06793814897537231},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.06640997529029846},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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/C118552586","wikidata":"https://www.wikidata.org/wiki/Q7867","display_name":"Psychiatry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pact.1999.807534","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact.1999.807534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"1999 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00425)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1977590451","https://openalex.org/W2023753260","https://openalex.org/W2026899276","https://openalex.org/W2057108708","https://openalex.org/W2095265034","https://openalex.org/W2110417760","https://openalex.org/W2118396891","https://openalex.org/W2166627447","https://openalex.org/W2167384564"],"related_works":["https://openalex.org/W2155564881","https://openalex.org/W2062808533","https://openalex.org/W1511880291","https://openalex.org/W1833217363","https://openalex.org/W2101300711","https://openalex.org/W2134658009","https://openalex.org/W2618418901","https://openalex.org/W2533764636","https://openalex.org/W2115392544","https://openalex.org/W1949605483"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"two":[3],"techniques":[4,71],"for":[5,11],"obtaining":[6],"a":[7,35,73],"sharp":[8,75],"lower":[9,37,76],"bound":[10,38,48,77],"the":[12,22,27,40,46,60,63,69,88,101,115],"multiprocessor":[13],"scheduling":[14,41],"problem":[15],"(MSP)":[16],"with":[17],"nonnegligible":[18],"communication":[19,31,103],"delay.":[20],"In":[21],"proposed":[23,70],"techniques,":[24],"we":[25],"apply":[26],"notion":[28],"of":[29,45,62,83,90],"inevitable":[30],"delay":[32],"to":[33,114],"obtain":[34],"nontrivial":[36],"on":[39,54],"length.":[42],"The":[43],"effectiveness":[44],"derived":[47],"is":[49,66,79,92,105],"evaluated":[50],"by":[51],"conducting":[52],"experiments":[53],"several":[55],"randomly":[56],"generated":[57],"instances.":[58],"By":[59],"results":[61],"experiments,":[64],"it":[65],"shown":[67],"that":[68,78],"generate":[72],"very":[74,94,107],"at":[80,97],"least":[81,98],"97.5%":[82],"an":[84],"upper":[85],"bound,":[86],"when":[87],"number":[89],"processors":[91],"not":[93,106],"small":[95],"(e.g.,":[96,109],"10)":[99],"and":[100],"maximum":[102],"cost":[104],"large":[108],"less":[110],"than":[111],"or":[112],"equal":[113],"minimum":[116],"execution":[117],"cost).":[118]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}