{"title":"The simulation of a microprocessor based event set processor","authors":"J. Comfort","doi":"10.5555/800077.802495","DOIUrl":"https://doi.org/10.5555/800077.802495","url":null,"abstract":"The availability of inexpensive, sophisticated microprocessors affords the computer system designer great flexibility in assigning simulation processes to independent computing elements. In this paper, the feasibility of assigning the functions of event set manipulation to a separate microprocessing element is investigated. Analysis of a large simulation program was performed to determine the relative amount of computer time required for event set processing, and the pattern of activation sequences for the event set processor. A simulation model was constructed to contrast the performance of a stand-alone computer system with that of a system using the same central processor and an independent event set processor. Parameters which were varied are processor and program loading relative processor speeds, and parameters to the event set algorithms. Performance results and a suggestion for the organization of a microprocessor based discrete event simulation computer are presented.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133686835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A simulation model of the MICRONET computer system during join processing","authors":"Joseph D. Brownsmith","doi":"10.5555/800077.802494","DOIUrl":"https://doi.org/10.5555/800077.802494","url":null,"abstract":"The MICRONET computer system was specifically designed for processing distributed relational databases. This paper describes a simulation study of the queueing and resource utilization of this system during processing of a relational join operation. Problems associated with representing a computer network in a simulation model are presented. In our model, one set of simulation facilities can represent any node of interest in the network. The processing at each node involves competition for resources by the data bus and the join algorithm. This was represented by processes which were synchronized by Wait Event and Post Event primitives. An algorithm for interrupting a non-shareable resource (e.g. the cpu) was also developed. Results for various system loadings and database sizes are presented.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127651912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hierarchical modeling in GASP","authors":"L. Rose","doi":"10.5555/800077.802506","DOIUrl":"https://doi.org/10.5555/800077.802506","url":null,"abstract":"This paper describes the design methodology and resultant implementation of a large-scale computer systems simulation model. A hierarchical approach is determined appropriate for the system design specification. The model implementation is highlighted, demonstrating that hierarchical, reentrant processes can be effectively modeled in the GASP simulation language.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115178517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The use of computer-simulated radiances to retrieve total atmospheric ozone data from satellite-mounted infrared multifilter radiometers","authors":"P. Weidhaas","doi":"10.5555/800077.802505","DOIUrl":"https://doi.org/10.5555/800077.802505","url":null,"abstract":"Between March 1977 and February 1980, four satellites equipped with multichannel filter radiometer (MFR) sensors supplied infrared radiance data at various spectral channels. The Satellite Ozone Analysis Center (SOAC) at the Lawrence Livermore National Laboratory received the radiance data from the U.S. Air Force. An ozone retrieval model was developed by SOAC in order to derive total ozone values from the radiance data. Statistical comparison against a network of ground observatories which measure total ozone with a Dobson spectrophotometer showed good agreement between MFR-derived ozone data and Dobson measurements. Thus, the scientific feasibility of SOAC's ozone retrieval model was established. Currently, SOAC has begun to automate the processing and archiving of the MFR data. Daily computer-generated contour maps of the global ozone distribution will be produced for dissemination to the scientific community. Extensive data analysis is also in progress.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"23 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120840915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Run-time characteristics of a simulation model","authors":"E. Gehringer, H. Schwetman","doi":"10.1145/1013610.807307","DOIUrl":"https://doi.org/10.1145/1013610.807307","url":null,"abstract":"This paper compares the efficiency of trace-driven simulation models of computer systems with the efficiency of function driven models. In a trace-driven model (TDM), the next service request for a task is selected from a file of requests which was created earlier, often from data derived from a functioning system. This can be compared to a function-driven model (FDM), in which the next service request is selected using generation techniques based on random deviates. While both kinds of models can produce statistically accurate results, a TDM is thought to be inherently more accurate, but it has been suspected that a FDM is faster.\u0000 The comparison of these two techniques is based on a simulation model of a computer system which has been specially constructed so as to operate either as a TDM or an FDM. The key feature of the study is that by using this model, we have isolated the demand-generation technique (either trace-driven or function-driven) as the single factor affecting performance of the model. A run-time program monitor and a software-monitor event probe are used to evaluate the resources used by various runs of the two kinds of simulation models. The results indicate that, contrary to earlier expectations, the performance of both techniques is comparable. We also demonstrate the effects of various block sizes on the performance of the TDM and the effects of the complexity of the request functions on the performance of the FDM.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121917406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A queuing model with discrete service speeds","authors":"H. Asai, S. C. Lee","doi":"10.1145/1013610.807311","DOIUrl":"https://doi.org/10.1145/1013610.807311","url":null,"abstract":"An input source of the model is generated in accordance with a probability density function Pr (n,t), where n and t are a spatial variable and a time variable, respectively. Thus the input arrives as a time-variable train. A queue consists of m blocks, and each block consists of a finite number of small waiting spaces. A single service facility is used in the model, and its service processing speed is a constant that is selected from several operational rates. The next higher operational speed and the next lower operational speed are twice as fast as and half as slow as the present constant speed, respectively. The service discipline is first-come-first-served.\u0000 When the needed queuing space exceeds the queuing space available, a congestion or input loss occurs. Minimizing such input loss with the least admissible queuing space and the slowest possible service speed is desirable. When the service facility is a machine, it may be easier and more economical to increase the service speed operations rather than to furnish a larger amount of queuing space.\u0000 The model is simulated on a digital computer. Two service Speed controls are examined in the simulation. The first is a deterministic control, and the second is a probabilistic control. In the former, when the amount of the queuing space available is almost consumed, the service speed is upgraded to the next higher rate. The speed remains at this rate until the amount of unused queuing space increases. Later, the speed is downgraded to the original rate. In the latter, control is switched probabilistically no matter what the queuing space may be but it can specify a service processing distribution among different speeds during a long time period.\u0000 The simulated results or the probability of congestion Pe with various queuing space lengths and service speeds is presented. This information may be useful for understanding input loss phenomena as well as for designing an efficient low-cost queuing system.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126454870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A dynamic clustering strategy in a demand paging environment","authors":"U. Pooch","doi":"10.1145/1013610.807296","DOIUrl":"https://doi.org/10.1145/1013610.807296","url":null,"abstract":"An algorithm is presented which dynamically clusters pages of a problem program based on its past program behavior (i.e. reference string patterns) in a demand paged virtual memory environment. The objective of this algorithm is to minimize the number of page faults during execution, while at the same time use memory page frames efficiently. Dynamic clusters of time and reference related pages are built during a program's execution time.\u0000 Whenever a page fault for the i-th page occurs in this time evolving environment, the pages of the cluster associated with the i-th page is compared to the pages currently in real (physical) memory. Thus during this current page fault, the demanded page, and any associated clustered pages not currently in physical memory are placed into memory. Page frames holding pages not in the current cluster are returned to the memory management system. Thus the physical amount of memory allocated to a processing program is dependent upon the size of the associated cluster at that time.\u0000 Simulation results of program behavior operating under this dynamic clustering strategy indicates that significant improvements in page faults and in the space time product may be achieved. The algorithm requires fewer real page frames per executed instruction than most currently implemented algorithms that utilize a fixed number of page frames per problem programs (i.e. fixed allocated partition or region).\u0000 The algorithm, MLMM (Modified Locality Matrix Model), an extension of work by Hedges and Pooch [12] is used to determine inherent program locality to predict independent dynamic program behavior, separating instruction from data references. Furthermore, strength coefficients between weakly or loosely coupled clusters are used to refine the cluster population, identify cluster transitions, as well as indicate the behavior of the cluster formations.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124118686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A heuristic teleprocessing network design technique","authors":"Henry Livings, U. Pooch","doi":"10.1145/1013610.807301","DOIUrl":"https://doi.org/10.1145/1013610.807301","url":null,"abstract":"A technique is presented for designing teleprocessing networks on the basis of weighted heuristic partitions of the network nodes. The partitions group the nodes on the basis of common internodal design characteristics related to traffic flow, geographical location, delay and reliability requirements. Weights incorporated into the partition selection process permit adaptive adjustment of the design system based on actual experience gained in designing networks.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116092374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Workload classification: Problems and techniques","authors":"H. Artis, R. E. Paulhamus","doi":"10.1145/1013610.807303","DOIUrl":"https://doi.org/10.1145/1013610.807303","url":null,"abstract":"Workload classification is a methodology which allows the analyst to describe the workload of a computer system with a minimum number of job classes. This technique reduces the effort required to produce models of a system. This could involve verification of actual systems or simulation of proposed configurations. Particular areas of interest include:\u0000 - cluster analysis techniques\u0000 - analysis of batch systems\u0000 - analysis of real time systems\u0000 - applications with simulation models.\u0000 The authors primary area of interest is in large commercial production oriented environments with both batch and real time applications.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121763725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"I/O buffer performance in a virtual memory system","authors":"S. Sherman, R. Brice","doi":"10.1145/1013610.807297","DOIUrl":"https://doi.org/10.1145/1013610.807297","url":null,"abstract":"In this study we construct a simulator of a data base management system running in a virtual memory environment. We use the simulator to investigate the value of using an I/O buffer in this environment. The simulator is driven by trace data obtained with a software probe. The simulator is validated and is used to verify a theoretical model which predicts paging and disk access rates produced by use of an I/O buffer in a virtual memory environment. Results from a multi-factor set of simulation experiments are analyzed. The factors include three page replacement algorithms, four buffer management algorithms, five virtual buffer sizes, three values for real memory and six well known and widely differing distributions for creating sequences of requests to the simulated data base management system.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1976-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126765666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
