{"id":"https://openalex.org/W2168645832","doi":"https://doi.org/10.1002/cpe.4330060204","title":"Parallel simulation based on conservative time windows: A performance study","display_name":"Parallel simulation based on conservative time windows: A performance study","publication_year":1994,"publication_date":"1994-04-01","ids":{"openalex":"https://openalex.org/W2168645832","doi":"https://doi.org/10.1002/cpe.4330060204","mag":"2168645832"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330060204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330060204","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","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/A5030401687","display_name":"Rassul Ayani","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Rassul. Ayani","raw_affiliation_strings":["Department of Teleinformatics, Computer Systems Laboratory Royal Institute of Technology KTH-Electrum 204 S-164 40, Kista Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Teleinformatics, Computer Systems Laboratory Royal Institute of Technology KTH-Electrum 204 S-164 40, Kista Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048619348","display_name":"Hassan Rajaei","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Hassan Rajaei","raw_affiliation_strings":["Department of Teleinformatics, Computer Systems Laboratory Royal Institute of Technology KTH-Electrum 204 S-164 40, Kista Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Teleinformatics, Computer Systems Laboratory Royal Institute of Technology KTH-Electrum 204 S-164 40, Kista Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0524,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92389629,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":"2","first_page":"119","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":1.0,"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/T11195","display_name":"Simulation Techniques and Applications","score":1.0,"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.9919999837875366,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7975374460220337},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.6623990535736084},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6513925194740295},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5681848526000977},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.49732258915901184},{"id":"https://openalex.org/keywords/discrete-event-simulation","display_name":"Discrete event simulation","score":0.48816829919815063},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4539186954498291},{"id":"https://openalex.org/keywords/sequent","display_name":"Sequent","score":0.4305408298969269},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4293835759162903},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42775478959083557},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.16512534022331238},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.1353742480278015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12148803472518921},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.08160847425460815},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.0760536789894104}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7975374460220337},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.6623990535736084},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6513925194740295},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5681848526000977},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.49732258915901184},{"id":"https://openalex.org/C147203929","wikidata":"https://www.wikidata.org/wiki/Q574814","display_name":"Discrete event simulation","level":2,"score":0.48816829919815063},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4539186954498291},{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.4305408298969269},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4293835759162903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42775478959083557},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.16512534022331238},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.1353742480278015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12148803472518921},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.08160847425460815},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0760536789894104},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.4330060204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330060204","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1531818788","https://openalex.org/W1550129609","https://openalex.org/W1974020230","https://openalex.org/W2002966090","https://openalex.org/W2089867526","https://openalex.org/W2094133019","https://openalex.org/W2104864218","https://openalex.org/W2105960904","https://openalex.org/W2118714975","https://openalex.org/W2118900647","https://openalex.org/W2119360641","https://openalex.org/W2296636214","https://openalex.org/W4232743967","https://openalex.org/W4250665388","https://openalex.org/W4255550812","https://openalex.org/W6631871050"],"related_works":["https://openalex.org/W2280276996","https://openalex.org/W4251646492","https://openalex.org/W2914653848","https://openalex.org/W1971174658","https://openalex.org/W4292767243","https://openalex.org/W122808420","https://openalex.org/W2231337787","https://openalex.org/W4381616941","https://openalex.org/W2099195351","https://openalex.org/W4232760339"],"abstract_inverted_index":{"Abstract":[0],"The":[1,17,37,68,143],"paper":[2],"presents":[3],"a":[4,41,74,78],"Conservative":[5],"Time":[6],"Window":[7],"(CTW)":[8],"algorithm":[9,39,70,91,150],"for":[10,44],"parallel":[11],"simulation":[12],"of":[13,30,56,88,95,115,125,136],"discrete":[14],"event":[15,138],"systems.":[16],"physical":[18],"system":[19],"to":[20,109],"be":[21,65],"simulated":[22],"is":[23,32],"partitioned":[24],"into":[25],"n":[26],"disjoint":[27],"sub\u2010systems,":[28],"each":[29,45,52,129],"which":[31],"represented":[33],"by":[34,119],"an":[35],"object":[36],"CTW":[38,69,90,149],"identifies":[40],"time":[42],"window":[43,53],"object,":[46],"such":[47],"that":[48,147],"events":[49,57,126],"occurring":[50,127],"in":[51,58,128,154],"are":[54],"independent":[55,116],"other":[59],"windows":[60,117],"and":[61,100,122],"thus":[62],"they":[63],"can":[64],"processed":[66],"concurrently.":[67],"was":[71],"implemented":[72],"on":[73,92,141],"shared":[75],"memory":[76],"multiprocessor,":[77],"Sequent":[79],"Symmetry":[80],"S81":[81],"with":[82,102],"16":[83],"processors.":[84],"We":[85,105,131],"measured":[86],"performance":[87,153],"the":[89,120,134,148],"two":[93],"types":[94],"network":[96],"topologies:":[97],"feed\u2010forward":[98],"networks":[99,101],"feedback":[103],"loops.":[104],"used":[106],"three":[107],"metrics":[108],"measure":[110],"performance:":[111],"speed\u2010up,":[112],"average":[113,123],"number":[114,124],"detected":[118],"algorithm,":[121],"window.":[130],"also":[132],"investigated":[133],"impact":[135],"various":[137],"scheduling":[139],"policies":[140],"performance.":[142],"results":[144],"obtained":[145],"show":[146],"produces":[151],"good":[152],"many":[155],"cases.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}