{"title":"Optimistic parallel simulation of a large-scale view storage system","authors":"G. Yaun, C. Carothers, S. Adali, D. Spooner","doi":"10.1109/WSC.2001.977457","DOIUrl":null,"url":null,"abstract":"In this paper we present the design and implementation of a complex view storage system model that is suitable for execution on a optimistic parallel simulation engine. What is unique over other optimistic systems is that reverse computation as opposed to state-saving is used to support the rollback mechanism. In this model, a hierarchy of view storage servers are connected to an array of client-side local disks. The term view refers to the output or result of a query made on the part of an application that is executing on a client machine. These queries can to be arbitrarily complex and done using SQL. In our performance study of this model, we find that speedups range from 1.5 to over 5 on 4 processors. Super-linear speedups are attributed to a slow memory subsystem and the increased availability of level-1 and level-2 cache when moving to a larger number of processors.","PeriodicalId":275394,"journal":{"name":"Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WSC.2001.977457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper we present the design and implementation of a complex view storage system model that is suitable for execution on a optimistic parallel simulation engine. What is unique over other optimistic systems is that reverse computation as opposed to state-saving is used to support the rollback mechanism. In this model, a hierarchy of view storage servers are connected to an array of client-side local disks. The term view refers to the output or result of a query made on the part of an application that is executing on a client machine. These queries can to be arbitrarily complex and done using SQL. In our performance study of this model, we find that speedups range from 1.5 to over 5 on 4 processors. Super-linear speedups are attributed to a slow memory subsystem and the increased availability of level-1 and level-2 cache when moving to a larger number of processors.