{"title":"数千个通用同构Fork/Join队列的快速仿真","authors":"R. Chen, Haiying Zhang, Hailong Hu","doi":"10.1109/ISMS.2010.63","DOIUrl":null,"url":null,"abstract":"In this paper, we present a fast solution to simulate general K-queue HFJ (Homogeneous Fork/Join) systems with thousands of parallel queues in minutes for the mean response time, which we denote by T[K]. The solution offers a general tool to simulate and compare T[K] for different algorithms of HFJ systems. As an application, we use it to compare simulation results with our published theorems in [1]. By using a regular DELL Latitude E4300 laptop, the simulation for 2000 M/M/1 queues lasts only 28 minutes with 1G memory for 5 million warming-up jobs and 10 million analysis jobs. We also offer corresponding source codes and executable files for three different queuing systems on our website for others to use.","PeriodicalId":434315,"journal":{"name":"2010 International Conference on Intelligent Systems, Modelling and Simulation","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Fast Simulation for Thousands of General Homogeneous Fork/Join Queues\",\"authors\":\"R. Chen, Haiying Zhang, Hailong Hu\",\"doi\":\"10.1109/ISMS.2010.63\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a fast solution to simulate general K-queue HFJ (Homogeneous Fork/Join) systems with thousands of parallel queues in minutes for the mean response time, which we denote by T[K]. The solution offers a general tool to simulate and compare T[K] for different algorithms of HFJ systems. As an application, we use it to compare simulation results with our published theorems in [1]. By using a regular DELL Latitude E4300 laptop, the simulation for 2000 M/M/1 queues lasts only 28 minutes with 1G memory for 5 million warming-up jobs and 10 million analysis jobs. We also offer corresponding source codes and executable files for three different queuing systems on our website for others to use.\",\"PeriodicalId\":434315,\"journal\":{\"name\":\"2010 International Conference on Intelligent Systems, Modelling and Simulation\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-01-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Intelligent Systems, Modelling and Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMS.2010.63\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Intelligent Systems, Modelling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMS.2010.63","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
摘要
在本文中，我们提出了一种快速的解决方案来模拟具有数千个并行队列的通用K-队列HFJ (Homogeneous Fork/Join)系统，其平均响应时间为分钟，我们用T[K]表示。该方案提供了一个通用的工具来模拟和比较不同算法的HFJ系统的T[K]。作为一个应用，我们用它来比较模拟结果与我们在[1]中发表的定理。通过使用普通的DELL Latitude E4300笔记本电脑，2000 M/M/1队列的模拟仅持续28分钟，内存为1G，可执行500万个预热作业和1000万个分析作业。我们还在网站上提供了三种不同排队系统的相应源代码和可执行文件，供他人使用。
A Fast Simulation for Thousands of General Homogeneous Fork/Join Queues
In this paper, we present a fast solution to simulate general K-queue HFJ (Homogeneous Fork/Join) systems with thousands of parallel queues in minutes for the mean response time, which we denote by T[K]. The solution offers a general tool to simulate and compare T[K] for different algorithms of HFJ systems. As an application, we use it to compare simulation results with our published theorems in [1]. By using a regular DELL Latitude E4300 laptop, the simulation for 2000 M/M/1 queues lasts only 28 minutes with 1G memory for 5 million warming-up jobs and 10 million analysis jobs. We also offer corresponding source codes and executable files for three different queuing systems on our website for others to use.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
