{"title":"Stack simulation for set-associative V/R-type caches","authors":"C. E. Wu, Yarsun Hsu, Yew-Huey Liu","doi":"10.1109/CMPSAC.1992.217582","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217582","url":null,"abstract":"Efficient stack simulation has been successfully applied in physically indexed caches with physical or real tags to generate the number of misses and write backs for various cache configurations in a single run. The authors devise a stack simulation algorithm for virtually indexed caches with real tags. Using markers with a valid range for synonym lines, the algorithm is able to keep track of stack distances for various cache configurations. In addition to cache miss ratios and number of write backs, the algorithm reports pseudonym frequency for all cache configurations under investigation. A one-pass cache simulator based on the algorithm is developed, and its results on sample traces are reported.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124305201","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":"FM/sup 2/: a simulator for fine-grained message-passing multicomputers in k-ary n-cube networks","authors":"Jing-Shiang Tseng, C. King","doi":"10.1109/CMPSAC.1992.217581","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217581","url":null,"abstract":"A simulation tool, called FM/sup 2/, for analyzing low-dimensional k-ary n-cube networks and their processor/router architecture is presented. The simulator helps to evaluate the network performance in fine-grained, scalable multicomputers by using a predefined simulation language. The language can be used to specify network parameters such as system configuration, flow control mechanism, processor/router interface, channel arbitration, and routing algorithm. Outputs generated by the simulator include average message latency, expected execution time, network hot spots, contention spots, message hit ratio, and size of message pools. A non-blocking send and blocking receive programming model is assumed.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"2002 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125279191","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":"SimUI: graphical user interface evaluation using playback","authors":"Nobuko Kishi","doi":"10.1109/CMPSAC.1992.217592","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217592","url":null,"abstract":"The author describes a set of tools for evaluating graphical user interface designs during software development. These tools record mouse and keyboard operations by users and compare them to detect potential usability problems. The tools two main techniques are data gathering in playback mode and multistep matching of recorded data. A preliminary experiment showed that the tools can automate part of the usability evaluation process by detecting differences often overlooked by human observers.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125283083","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":"Fault tolerant process planning and control","authors":"R. Dubash, I. Yen, F. Bastani","doi":"10.1109/CMPSAC.1992.217570","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217570","url":null,"abstract":"The authors develop a model for achieving reliable and high-performance control programs. The approach combines hierarchical control, inherent fault tolerance, and massive parallelism. The approach uses a fine-grain cellular automation for implementing the supervisory task of a hierarchical system. The use of massive parallelism significantly enhances the reliability of the process control system and speeds up the planning time. The authors present an algorithm for generating plans using cellular automation based on a discrete ray tracing algorithm. The formulated plan is optimal for the given class of control programs.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126462874","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":"SAD kernels: a software tool to evaluate synchronization behavior of multiprocessors","authors":"A. Nanda, L. Ni","doi":"10.1109/CMPSAC.1992.217562","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217562","url":null,"abstract":"The authors propose a method to characterize the performance of multiprocessor systems at the level of a single grain, called a unit grain, of execution. The characterization is via experimental measurement of individual components of performance. The authors introduce a family of artificial workload kernels, called SAD-kernels, as an effective tool for measuring this performance. The usefulness of these kernels lies in their ability to selectively assess a given shared-memory multiprocessor along several performance dimensions that can be controlled by the person performing the evaluation. The proposed methodology was demonstrated by measuring and comparing the performance of two commercial shared-memory machines currently in use.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"88 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126308389","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 view of the GDMO interface definition language","authors":"R. Fraley","doi":"10.1109/CMPSAC.1992.217598","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217598","url":null,"abstract":"Large distributed systems require increased facilities for distributed management. Common interfaces for accessing remote resources are critical for such facilities. GDMO is a management interface definition language that is an international standard for defining management interfaces. GDMO is object oriented. Interfaces are defined as classes, which may be inherited by other class definitions. Multiple inheritance is supported, and is useful for constructing resources that can be managed under several interfaces. The properties of GDMO are discussed.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129296993","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":"Multilanguage programming: an automatic-type-mapping approach","authors":"Arturo J. Sánchez-Ruíz, E. Glinert","doi":"10.1109/CMPSAC.1992.217603","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217603","url":null,"abstract":"The data type correspondence problem arises when one tries to interconnect, within a single program, modules written in different languages and therefore within the framework of different type systems. An interconnection model is proposed which hides details such as interlanguage data type mappings and low level communications, which are irrelevant or confusing to most programmers. Using this model, the authors develop an automated solution to the problem of finding, for a given type in a given programming language, the corresponding type in another programming language. They compare this approach with others which have been proposed in the literature, and discuss a prototype implementation in detail.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114192001","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":"H-PCTE-a high performance object management system for system development environments","authors":"U. Kelter","doi":"10.1109/CMPSAC.1992.217605","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217605","url":null,"abstract":"H-PCTE is an object management system (OMS) for distributed, open, and integrated system development environments. H-PCTE performs up to several thousand simple operations per second. H-PCTE is intended to be a basis for environments in which tools operate directly on fine-grained data stored in the object base. Fine-grained data modeling has several important implications for the architecture of environments, for tool design, and for the necessary functionality of the OMS. H-PCTE's performance is due to main-memory-oriented implementation techniques and to a careful adaptation of the OMS services to the data management needs of tools. As a result, tools need not pay for OMS services which they do not really need. This applies in particular to recovery and the external view facilities.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116032518","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":"Support tool and strategy for type error correction with polymorphic types","authors":"H. Maruyama, Masaki Matsuyama, K. Araki","doi":"10.1109/CMPSAC.1992.217552","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217552","url":null,"abstract":"The authors focus on strongly typed functional programming languages with polymorphic types, type inference facilities, and higher-order functions, i.e. functional programming languages whose type checkers infer types in programs including polymorphic types and higher-order functions types from the context before execution programs. They examine effective approaches to support type error corrections in these languages and two approaches to support them, following a general framework for debugging. Using these two approaches as case studies, systematic debugging processes based on the general framework for debugging are developed.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127915010","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":"Software fault-tolerance in functional programming","authors":"Ramaswamy Govindarajan","doi":"10.1109/CMPSAC.1992.217569","DOIUrl":"https://doi.org/10.1109/CMPSAC.1992.217569","url":null,"abstract":"Handing exceptions in functional languages has always been a problem, due to the inherent conflict between the control-flow-oriented approach of exception handlers and the functional style evaluation. The author proposes an approach that discards the conventional view of treating exceptions as a means of effecting control transfer. Instead, exceptions are used to change the state of an object: A terminate exception is viewed as shielding the input object. A resume exception designates the input object as curable and requires the immediate application of a handler function. This approach enables the description of the semantics of exception raising functions without associating any implementation restriction and without the loss of referential transparency and commutating of functions.<<ETX>>","PeriodicalId":286518,"journal":{"name":"[1992] Proceedings. The Sixteenth Annual International Computer Software and Applications Conference","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130281135","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}