{"id":"https://openalex.org/W1982977898","doi":"https://doi.org/10.1177/003754979706800405","title":"Simulation Study of Task Scheduling and Resequencing in a Multiprocessing System","display_name":"Simulation Study of Task Scheduling and Resequencing in a Multiprocessing System","alternate_titles":[],"publication_year":1997,"publication_date":"1997-04-01","ids":{"openalex":"https://openalex.org/W1982977898","doi":"https://doi.org/10.1177/003754979706800405","mag":"1982977898"},"language":"en","primary_location":{"id":"doi:10.1177/003754979706800405","doi":"https://doi.org/10.1177/003754979706800405","is_oa":false,"landing_page_url":"https://doi.org/10.1177/003754979706800405","pdf_url":null,"source":{"id":"https://openalex.org/S32573412","display_name":"SIMULATION","issn_l":"0037-5497","issn":["0037-5497","1741-3133"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-d","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIMULATION","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W1982977898"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5054225874","display_name":"Helen D. Karatza","orcid":"https://orcid.org/0000-0002-9789-0585","observed_orcids":["https://orcid.org/0000-0002-9789-0585"]},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Helen D. Karatza","raw_affiliation_strings":["Department of Informatics, Aristotle University of Thessaloniki , Thessaloniki, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, Aristotle University of Thessaloniki , Thessaloniki, Greece","institution_ids":["https://openalex.org/I21370196"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054225874"],"corresponding_institution_ids":["https://openalex.org/I21370196"],"apc_list":{"value":4150,"currency":"USD","value_usd":4150},"apc_paid":null,"fwci":0.6723,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.65356902,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"68","issue":"4","first_page":"241","last_page":"247"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.4503999948501587,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.4503999948501587,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.2590000033378601,"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/T11195","display_name":"Simulation Techniques and Applications","score":0.09459999948740005,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.9779999852180481},{"id":"https://openalex.org/keywords/multiprocessor-systems","display_name":"multiprocessor systems","score":0.8270000219345093},{"id":"https://openalex.org/keywords/closed-queuing-networks","display_name":"closed queueing networks","score":0.652999997138977},{"id":"https://openalex.org/keywords/first-come-first-served","display_name":"first come first served","score":0.7940000295639038},{"id":"https://openalex.org/keywords/parallel-application-performance","display_name":"parallel program performance","score":0.9210000038146973}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8088329434394836},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6490309238433838},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6359096169471741},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5874266028404236},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5805703401565552},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5576321482658386},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5404248237609863},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.4829637110233307},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.4700019955635071},{"id":"https://openalex.org/C59656382","wikidata":"https://www.wikidata.org/wiki/Q191536","display_name":"Conjunction (astronomy)","level":2,"score":0.4570498764514923},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44624820351600647},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4195975661277771},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3197404742240906},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.2581453323364258},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.22340667247772217},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19408035278320312},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13580700755119324},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1177/003754979706800405","doi":"https://doi.org/10.1177/003754979706800405","is_oa":false,"landing_page_url":"https://doi.org/10.1177/003754979706800405","pdf_url":null,"source":{"id":"https://openalex.org/S32573412","display_name":"SIMULATION","issn_l":"0037-5497","issn":["0037-5497","1741-3133"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-d","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIMULATION","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.978.2527","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.978.2527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sim.sagepub.com/content/68/4/241.full.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1827692084","https://openalex.org/W1995070612","https://openalex.org/W2143328170","https://openalex.org/W2171078587","https://openalex.org/W2970576388"],"related_works":["https://openalex.org/W2094979434","https://openalex.org/W2137873777","https://openalex.org/W1652815913","https://openalex.org/W2296851665","https://openalex.org/W2171078587","https://openalex.org/W1882326900","https://openalex.org/W1936328239","https://openalex.org/W3143676421","https://openalex.org/W2339471019"],"abstract_inverted_index":{"The":[0,66],"performance":[1,72,99],"of":[2,15,28,44,56,73,91,108,115],"parallel":[3],"programs":[4],"such":[5],"as":[6],"fork-join":[7],"jobs":[8],"is":[9,51,77,84,118],"significantly":[10],"affected":[11,78],"by":[12,79],"the":[13,26,53,71,74,80,94,101,112,122,128,139],"choice":[14],"policy":[16,96,102,123],"used":[17],"to":[18,106,127],"schedule":[19,37],"tasks.":[20,116],"In":[21],"this":[22],"paper":[23],"we":[24],"present":[25],"results":[27,68],"a":[29,88,109],"simulation":[30,67],"study":[31],"comparing":[32],"three":[33,75],"basic":[34],"policies":[35,76],"that":[36,70,86,103,121,124],"independent":[38,59],"tasks":[39,107],"in":[40,138],"conjunction":[41],"with":[42],"resequencing":[43,81],"jobs.":[45],"A":[46],"closed":[47],"queuing":[48],"network":[49],"model":[50],"considered;":[52],"CPU":[54],"consists":[55],"homogeneous":[57],"and":[58],"processors,":[60],"each":[61],"serving":[62],"its":[63],"own":[64],"queue.":[65],"reveal":[69],"delay.":[82],"It":[83,117],"shown":[85,120],"over":[87],"wide":[89],"range":[90],"system":[92],"parameters":[93],"first-come-first-served":[95],"exhibits":[97],"better":[98],"than":[100],"gives":[104,125],"priority":[105,126],"job":[110],"having":[111],"smallest":[113,129],"number":[114],"also":[119],"task":[130,140],"performs":[131],"best":[132],"when":[133],"there":[134],"are":[135],"large":[136],"variations":[137],"service":[141],"times.":[142]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1982977898","counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
