Pub Date : 1992-01-07DOI: 10.1109/HICSS.1992.183289
G. Sabot
Describes the techniques that are used in the CM Fortran 1.0 compiler to map the fine-grained array parallelism of Fortran 90 onto the CM-2 architecture. The compiler views the parallel hardware at a much lower level of detail than did previous CM-2 compilers, which had targeted a function library named Paris. In the slicewise machine model used by CM Fortran 1.0, the FPUs, their registers, and the memory hierarchy are directly exposed to the compiler. Thus, the CM-2 target machine is not 64K simple bit-serial processors. Rather, the target is a machine containing 2K PEs (processing elements), where each PE is both superpipelined and superscalar. The compiler uses data distribution to spread the problem out among the 2K processors. A new compiler phase is used to separate the code that runs on the two types of processors in the CM: the parallel PEs, which execute a new RISC-like instruction set called PEAC, and the scalar front-end processor, which executes SPARC or VAX assembler code. The pipelines in PEs are filled by using conventional vector processing techniques along with a new, RISC-like vector instruction set. An innovative scheduler overlaps the execution of a number of RISC operations. This new compiler has greatly increased the performance of Fortran codes on the CM-2 on many important computation kernels, such as climate modeling, seismic processing, and hydrodynamics simulations.<>
{"title":"Optimized CM Fortran compiler for the Connection Machine computer","authors":"G. Sabot","doi":"10.1109/HICSS.1992.183289","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183289","url":null,"abstract":"Describes the techniques that are used in the CM Fortran 1.0 compiler to map the fine-grained array parallelism of Fortran 90 onto the CM-2 architecture. The compiler views the parallel hardware at a much lower level of detail than did previous CM-2 compilers, which had targeted a function library named Paris. In the slicewise machine model used by CM Fortran 1.0, the FPUs, their registers, and the memory hierarchy are directly exposed to the compiler. Thus, the CM-2 target machine is not 64K simple bit-serial processors. Rather, the target is a machine containing 2K PEs (processing elements), where each PE is both superpipelined and superscalar. The compiler uses data distribution to spread the problem out among the 2K processors. A new compiler phase is used to separate the code that runs on the two types of processors in the CM: the parallel PEs, which execute a new RISC-like instruction set called PEAC, and the scalar front-end processor, which executes SPARC or VAX assembler code. The pipelines in PEs are filled by using conventional vector processing techniques along with a new, RISC-like vector instruction set. An innovative scheduler overlaps the execution of a number of RISC operations. This new compiler has greatly increased the performance of Fortran codes on the CM-2 on many important computation kernels, such as climate modeling, seismic processing, and hydrodynamics simulations.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"ii 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129682350","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}
Pub Date : 1992-01-07DOI: 10.1109/HICSS.1992.183279
N. Boudriga, A. Mili, R. Zalila
A specification is complete if it carries all the information required by the user, and minimal if it carries nothing but the information required by the user. The authors have designed a lifecycle of the requirements specification phase, whose purpose is to help achieve completeness and minimality by the proper use of redundancy. In their view of the lifecycle, the verification and validation group elicits information from the user and matches it against the generated specification to check completeness and minimality. In this paper, the authors give details of this lifecycle, and present an automated system that carries out the proofs of completeness and minimality using Prolog's inference capability.<>
{"title":"An automated tool for specification validation: design and preliminary implementation","authors":"N. Boudriga, A. Mili, R. Zalila","doi":"10.1109/HICSS.1992.183279","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183279","url":null,"abstract":"A specification is complete if it carries all the information required by the user, and minimal if it carries nothing but the information required by the user. The authors have designed a lifecycle of the requirements specification phase, whose purpose is to help achieve completeness and minimality by the proper use of redundancy. In their view of the lifecycle, the verification and validation group elicits information from the user and matches it against the generated specification to check completeness and minimality. In this paper, the authors give details of this lifecycle, and present an automated system that carries out the proofs of completeness and minimality using Prolog's inference capability.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128043548","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}
Pub Date : 1992-01-07DOI: 10.1109/HICSS.1992.183424
L. Lim, I. Benbasat
An overview is given of the existing negotiation literature under the headings of game theory, economic models, political models, and sociological models. Inferring from the review the need for computer support for negotiation, the authors then propose a theory for understanding the effects due to a support system in a two-party, monolithic, and multiple-issue setting. The theory conceptualizes a negotiation support system as consisting of individual decision support systems interconnected with an electronic communication channel; accordingly, it postulates two sets of effects, one owing to the decision aid and the other to the communication support.<>
{"title":"From negotiation to negotiation support systems: a theoretical perspective","authors":"L. Lim, I. Benbasat","doi":"10.1109/HICSS.1992.183424","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183424","url":null,"abstract":"An overview is given of the existing negotiation literature under the headings of game theory, economic models, political models, and sociological models. Inferring from the review the need for computer support for negotiation, the authors then propose a theory for understanding the effects due to a support system in a two-party, monolithic, and multiple-issue setting. The theory conceptualizes a negotiation support system as consisting of individual decision support systems interconnected with an electronic communication channel; accordingly, it postulates two sets of effects, one owing to the decision aid and the other to the communication support.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121925939","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}
Pub Date : 1992-01-07DOI: 10.1109/HICSS.1992.183230
O. Gruber, L. Amsaleg, L. Daynès, P. Valduriez
Complex data-intensive application domains require a programming environment that should be both more productive and more efficient than the traditional approaches. This translates into three major requirements: efficient support for complex, persistent objects and collections; distribution transparency with control over parallelism; and transaction management. The authors present the design of Eos which aims at reducing the chronic mismatch between programming languages and database systems and avoiding the traditional redundancy between operating systems and database systems services. The main contributions of Eos are support for: uniform, distributed object management; safe object sharing with distributed, low-overhead garbage collection; and high-level mechanisms for dynamic object grouping and computation placement. Eos is currently being implemented on a network of Sun 3/60/sub s/ running Mach 3.0.<>
{"title":"Eos, an environment for object-based systems","authors":"O. Gruber, L. Amsaleg, L. Daynès, P. Valduriez","doi":"10.1109/HICSS.1992.183230","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183230","url":null,"abstract":"Complex data-intensive application domains require a programming environment that should be both more productive and more efficient than the traditional approaches. This translates into three major requirements: efficient support for complex, persistent objects and collections; distribution transparency with control over parallelism; and transaction management. The authors present the design of Eos which aims at reducing the chronic mismatch between programming languages and database systems and avoiding the traditional redundancy between operating systems and database systems services. The main contributions of Eos are support for: uniform, distributed object management; safe object sharing with distributed, low-overhead garbage collection; and high-level mechanisms for dynamic object grouping and computation placement. Eos is currently being implemented on a network of Sun 3/60/sub s/ running Mach 3.0.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121237377","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}
Pub Date : 1992-01-07DOI: 10.1109/HICSS.1992.183288
D. Rover
Observing the activities of a complex parallel computer system is no small feat, and relating these observations to program behavior is even harder. This paper presents a general measurement approach that is applicable to a large class of scalable programs and machines, specifically data parallel programs executing on distributed memory computer systems. The combined instrumentation and visualization paradigm, called VISTA (which stands for Visualization and Instrumentation of Scalable mulTicomputer Applications), is based on the author's experiences of programming and monitoring applications running on an nCUBE 2 computer and a MasPar MP-1 computer. The key is that performance data are treated similarly to any distributed data in the context of the data parallel programming model. Because of the data-parallel mapping of the program onto the machine, one can view the performance as it relates to each processor, processor cluster or processor ensemble and as it relates to the data structures of the program. The author illustrates the utility of VISTA by way of an example.<>
{"title":"A performance visualization paradigm for data parallel computing","authors":"D. Rover","doi":"10.1109/HICSS.1992.183288","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183288","url":null,"abstract":"Observing the activities of a complex parallel computer system is no small feat, and relating these observations to program behavior is even harder. This paper presents a general measurement approach that is applicable to a large class of scalable programs and machines, specifically data parallel programs executing on distributed memory computer systems. The combined instrumentation and visualization paradigm, called VISTA (which stands for Visualization and Instrumentation of Scalable mulTicomputer Applications), is based on the author's experiences of programming and monitoring applications running on an nCUBE 2 computer and a MasPar MP-1 computer. The key is that performance data are treated similarly to any distributed data in the context of the data parallel programming model. Because of the data-parallel mapping of the program onto the machine, one can view the performance as it relates to each processor, processor cluster or processor ensemble and as it relates to the data structures of the program. The author illustrates the utility of VISTA by way of an example.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122295945","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}
Pub Date : 1992-01-07DOI: 10.1109/HICSS.1992.183333
K. Kato, A. Ohori
One important concept established through research of persistent programming languages is orthogonal persistence. The techniques so far proposed for this concept are, however, limited to single language systems. This paper proposes a systematic method to achieve orthogonal persistence in a multilanguage system by combining a technique for higher-order remote procedure calls and a mechanism of orthogonal persistence in a single language system. The proposed method can be used to develop a multilanguage persistent type system, where any data of any types including higher-order functions can persist and can later be used from a different language. The necessary data conversion between languages is transparent to the user. In addition to an effective algorithm to implement a multilanguage persistent system, the authors system has rigorous type discipline and formal properties that enable them to show that multilanguage sharing preserves the intended semantics of persistent data.<>
{"title":"An approach to multilanguage persistent type system","authors":"K. Kato, A. Ohori","doi":"10.1109/HICSS.1992.183333","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183333","url":null,"abstract":"One important concept established through research of persistent programming languages is orthogonal persistence. The techniques so far proposed for this concept are, however, limited to single language systems. This paper proposes a systematic method to achieve orthogonal persistence in a multilanguage system by combining a technique for higher-order remote procedure calls and a mechanism of orthogonal persistence in a single language system. The proposed method can be used to develop a multilanguage persistent type system, where any data of any types including higher-order functions can persist and can later be used from a different language. The necessary data conversion between languages is transparent to the user. In addition to an effective algorithm to implement a multilanguage persistent system, the authors system has rigorous type discipline and formal properties that enable them to show that multilanguage sharing preserves the intended semantics of persistent data.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124241023","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}
Pub Date : 1992-01-07DOI: 10.1109/HICSS.1992.183462
V. Kommu, I. Pomeranz, T. Abdelrahman
The performance of an adaptive learning algorithm based on evolution (the genetic algorithm) is investigated in constrained boolean search spaces where some solutions may be infeasible. This paper describes a randomized validation procedure to limit the genetic search to feasible regions of the search space. Analysis of the effect of the validation procedure on genetic optimization is presented. The performance of the modified genetic search on the set covering problem is used to illustrate the usefulness of the analysis in selecting the algorithm's parameters.<>
{"title":"A genetic learning strategy in constrained search spaces","authors":"V. Kommu, I. Pomeranz, T. Abdelrahman","doi":"10.1109/HICSS.1992.183462","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183462","url":null,"abstract":"The performance of an adaptive learning algorithm based on evolution (the genetic algorithm) is investigated in constrained boolean search spaces where some solutions may be infeasible. This paper describes a randomized validation procedure to limit the genetic search to feasible regions of the search space. Analysis of the effect of the validation procedure on genetic optimization is presented. The performance of the modified genetic search on the set covering problem is used to illustrate the usefulness of the analysis in selecting the algorithm's parameters.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124376670","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}
Pub Date : 1992-01-07DOI: 10.1109/HICSS.1992.183285
John L. Gustafson
In measuring the performance of parallel computers, the usual method is to choose a problem and test the execution time as the processor count is varied. This model underlies definitions of 'speedup,' 'efficiency,' and arguments against parallel processing such as Ware's (1972) formulation of Amdahl's law (1967). Fixed time models use problem size as the figure of merit. Analysis and experiments based on fixed time instead of fixed size have yielded surprising consequences: the fixed time method does not reward slower processors with higher speedup; it predicts a new limit to speedup, which is more optimistic than Amdahl's; it shows an efficiency which is independent of processor speed and ensemble size; it sometimes gives non-spurious superlinear speedup; it provides a practical means (the SLALOM benchmark) of comparing computers of widely varying speeds without distortion.<>
{"title":"The consequences of fixed time performance measurement","authors":"John L. Gustafson","doi":"10.1109/HICSS.1992.183285","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183285","url":null,"abstract":"In measuring the performance of parallel computers, the usual method is to choose a problem and test the execution time as the processor count is varied. This model underlies definitions of 'speedup,' 'efficiency,' and arguments against parallel processing such as Ware's (1972) formulation of Amdahl's law (1967). Fixed time models use problem size as the figure of merit. Analysis and experiments based on fixed time instead of fixed size have yielded surprising consequences: the fixed time method does not reward slower processors with higher speedup; it predicts a new limit to speedup, which is more optimistic than Amdahl's; it shows an efficiency which is independent of processor speed and ensemble size; it sometimes gives non-spurious superlinear speedup; it provides a practical means (the SLALOM benchmark) of comparing computers of widely varying speeds without distortion.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"134 21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127775401","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}
Pub Date : 1992-01-07DOI: 10.1109/HICSS.1992.183275
P. Grogono, B. Cheung
Object-oriented methods allow programmers to construct software with a simple and uniform structure. Object-oriented programs should be simple to maintain and extend. Source code browsers are not sufficient for understanding object-oriented programs. The authors have combined a strongly-typed object-oriented language with an integrated, interactive development environment. For several reasons, they designed the compiler as an integral component of the environment. Coupling the compiler and the browser simplifies symbol table management in the compiler. Conversely, the same coupling ensures that information is semantically checked before the browser displays it. Also, programmers do not have to understand the class hierarchy because the compiler creates class views.<>
{"title":"A semantic browser for object oriented program development","authors":"P. Grogono, B. Cheung","doi":"10.1109/HICSS.1992.183275","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183275","url":null,"abstract":"Object-oriented methods allow programmers to construct software with a simple and uniform structure. Object-oriented programs should be simple to maintain and extend. Source code browsers are not sufficient for understanding object-oriented programs. The authors have combined a strongly-typed object-oriented language with an integrated, interactive development environment. For several reasons, they designed the compiler as an integral component of the environment. Coupling the compiler and the browser simplifies symbol table management in the compiler. Conversely, the same coupling ensures that information is semantically checked before the browser displays it. Also, programmers do not have to understand the class hierarchy because the compiler creates class views.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127988073","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}
Pub Date : 1992-01-07DOI: 10.1109/HICSS.1992.183417
B. Mennecke, J. Hoffer, B. E. Wynne
The psychology, speech communications, and management literature is rich with theory on the topic of group history and development. Three general categories of developmental models have been proposed: progressive, cyclical, and non-sequential. These models suggest that group performance, member behavior, and task focus change as the group matures and develops. Group support systems (GSS) have been created to assist groups in performing their tasks and activities. Several studies of key variables that influence group performance have produced mixed, and in some cases conflicting, results. This may be partially due to a lack of attention to the issue of group history and development. Only two known GSS studies address the effects of group development on group process, performance, and efficiency. To facilitate additional research into this area, a research framework that represents this development process is proposed along with several propositions implied by this framework.<>
{"title":"Group development and history in GSS research: a new research perspective","authors":"B. Mennecke, J. Hoffer, B. E. Wynne","doi":"10.1109/HICSS.1992.183417","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183417","url":null,"abstract":"The psychology, speech communications, and management literature is rich with theory on the topic of group history and development. Three general categories of developmental models have been proposed: progressive, cyclical, and non-sequential. These models suggest that group performance, member behavior, and task focus change as the group matures and develops. Group support systems (GSS) have been created to assist groups in performing their tasks and activities. Several studies of key variables that influence group performance have produced mixed, and in some cases conflicting, results. This may be partially due to a lack of attention to the issue of group history and development. Only two known GSS studies address the effects of group development on group process, performance, and efficiency. To facilitate additional research into this area, a research framework that represents this development process is proposed along with several propositions implied by this framework.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127530857","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：