Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48071
T. Ae, M. Yamashita, Kumiko Nitta
Scheduling problem for real-time systems is known to be intractable, i.e. NP-hard or completely NP for most cases. A neural computation technique is introduced to solve it within a limited time under a hard real-time environment. Although the neural computation can be effectively carried out by a multiprocessor, a special processor is designed to obtain the scheduled result with no overhead.<>
{"title":"Neural scheduler for real-time networks","authors":"T. Ae, M. Yamashita, Kumiko Nitta","doi":"10.1109/HICSS.1989.48071","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48071","url":null,"abstract":"Scheduling problem for real-time systems is known to be intractable, i.e. NP-hard or completely NP for most cases. A neural computation technique is introduced to solve it within a limited time under a hard real-time environment. Although the neural computation can be effectively carried out by a multiprocessor, a special processor is designed to obtain the scheduled result with no overhead.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129400163","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 : 1989-01-03DOI: 10.1109/HICSS.1989.48087
M. R. Greestreet, K. Li, J. Straunstrup
Synchronized Transitions, a language for describing digital hardware as concurrent programs, and its implementation on multiprocessors is presented. Synchronized Transitions provides a paradigm in which each operation (circuit element) is described as a separate process; these processes can interact synchronously or asynchronously. Programs can be compiled and executed on uniprocessor or multiprocessor computers, providing a convenient facility for simulating designs and experimenting with the programming paradigms of Synchronized Transitions. The program exhibit extensive parallelism. A partitioning technique utilizes this parallelism on stock multiprocessors.<>
{"title":"'Synchronized Transitions' on multiprocessors","authors":"M. R. Greestreet, K. Li, J. Straunstrup","doi":"10.1109/HICSS.1989.48087","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48087","url":null,"abstract":"Synchronized Transitions, a language for describing digital hardware as concurrent programs, and its implementation on multiprocessors is presented. Synchronized Transitions provides a paradigm in which each operation (circuit element) is described as a separate process; these processes can interact synchronously or asynchronously. Programs can be compiled and executed on uniprocessor or multiprocessor computers, providing a convenient facility for simulating designs and experimenting with the programming paradigms of Synchronized Transitions. The program exhibit extensive parallelism. A partitioning technique utilizes this parallelism on stock multiprocessors.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133962599","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 : 1989-01-03DOI: 10.1109/HICSS.1989.48046
J. Tsai, T. Weigert
The knowledge representation of software component relations using nonmonotonic logic to assist the validity and integrity checking of software information is presented. Software components and their interconnection information are represented by axioms that exhibit the structure and behavior of the software system. Another set of axioms represents the basic truisms about a software system in general. These axioms can easily be extended to cover a wide variety of software systems architectures. In the software development and maintenance phases, information about the software system can be derived from these axioms using an automated reasoning system, and the software system itself can easily be checked against a specification of the system and compared for validity. This knowledge-based system will provide programmers with useful software information and assist the software development and maintenance process.<>
{"title":"An intelligent assistant for software information checking using a non-monotonic reasoning system","authors":"J. Tsai, T. Weigert","doi":"10.1109/HICSS.1989.48046","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48046","url":null,"abstract":"The knowledge representation of software component relations using nonmonotonic logic to assist the validity and integrity checking of software information is presented. Software components and their interconnection information are represented by axioms that exhibit the structure and behavior of the software system. Another set of axioms represents the basic truisms about a software system in general. These axioms can easily be extended to cover a wide variety of software systems architectures. In the software development and maintenance phases, information about the software system can be derived from these axioms using an automated reasoning system, and the software system itself can easily be checked against a specification of the system and compared for validity. This knowledge-based system will provide programmers with useful software information and assist the software development and maintenance process.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124945207","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 : 1989-01-03DOI: 10.1109/HICSS.1989.47998
J. Górski
A formal approach to development of safety-related systems is presented. Three levels of system representation are treated within the common framework of temporal logic. The highest level is conceptual modeling, where the system is perceived from a global perspective. The conceptual model covers the part of the environment that is relevant from the safety point of view. The architectural model provides a different insight to the system: the components of the architecture are described individually, from the local perspective, and their interconnections are given by the structure specification. The lowest level represents the program, which is responsible for the behaviour of the logical (nonphysical) elements of system architecture. The approach is demonstrated by developing a simple railway crossing system.<>
{"title":"Formal approach to development of critical computer applications","authors":"J. Górski","doi":"10.1109/HICSS.1989.47998","DOIUrl":"https://doi.org/10.1109/HICSS.1989.47998","url":null,"abstract":"A formal approach to development of safety-related systems is presented. Three levels of system representation are treated within the common framework of temporal logic. The highest level is conceptual modeling, where the system is perceived from a global perspective. The conceptual model covers the part of the environment that is relevant from the safety point of view. The architectural model provides a different insight to the system: the components of the architecture are described individually, from the local perspective, and their interconnections are given by the structure specification. The lowest level represents the program, which is responsible for the behaviour of the logical (nonphysical) elements of system architecture. The approach is demonstrated by developing a simple railway crossing system.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130332260","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 : 1989-01-03DOI: 10.1109/HICSS.1989.48007
R. K. Atkins, D. Spence
The European Space Agency (ESA) is embarking on several major programs that will incorporate extensive degrees of autonomy, requiring software to be developed on a scale, complexity, and level of functional criticality greater than encountered before on ESA programs. The authors chart the development of the agency's software product assurance requirements. They describe the functional reliability and safety categorization schemes used, the analysis and failure categorization schemes used, the analysis and failure tolerance approaches and how the software safety and reliability studies conducted by the agency have influenced software requirements.<>
{"title":"The development of the software product assurance requirements of the European Space Agency","authors":"R. K. Atkins, D. Spence","doi":"10.1109/HICSS.1989.48007","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48007","url":null,"abstract":"The European Space Agency (ESA) is embarking on several major programs that will incorporate extensive degrees of autonomy, requiring software to be developed on a scale, complexity, and level of functional criticality greater than encountered before on ESA programs. The authors chart the development of the agency's software product assurance requirements. They describe the functional reliability and safety categorization schemes used, the analysis and failure categorization schemes used, the analysis and failure tolerance approaches and how the software safety and reliability studies conducted by the agency have influenced software requirements.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129930500","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 : 1989-01-03DOI: 10.1109/HICSS.1989.48038
J. Choobineh, S. Venkatraman
Business forms are used as the main input to the process of derivation of a set of functional dependencies. A form model is developed which abstracts the set of forms in a desired format. By analyzing the form schemas, a system deduces the functional dependencies which exist between the form fields. A rule-based inferential approach is used. System knowledge is divided into form selection, single-attribute-determinant identification, single-attribute-determinant functional dependencies, and multiattribute-determinant functional dependencies. The rules in the first category use knowledge about the form flow to determine the order in which the forms are analyzed. The rules in the next three categories determine functional dependencies.<>
{"title":"A methodology and tool for automated derivation of functional dependencies","authors":"J. Choobineh, S. Venkatraman","doi":"10.1109/HICSS.1989.48038","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48038","url":null,"abstract":"Business forms are used as the main input to the process of derivation of a set of functional dependencies. A form model is developed which abstracts the set of forms in a desired format. By analyzing the form schemas, a system deduces the functional dependencies which exist between the form fields. A rule-based inferential approach is used. System knowledge is divided into form selection, single-attribute-determinant identification, single-attribute-determinant functional dependencies, and multiattribute-determinant functional dependencies. The rules in the first category use knowledge about the form flow to determine the order in which the forms are analyzed. The rules in the next three categories determine functional dependencies.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129465437","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 : 1989-01-03DOI: 10.1109/HICSS.1989.48040
A. Moulton, S. Madnick
Theoretical results in formally defining and measuring database locality are presented. Database locality has proved less tractable than program locality, which has a long history of theoretical investigation and application in virtual memory systems and processor catches. The stages at which database locality can be observed and the differences between database and program locality are identified. A technique for adapting the program locality model to both temporal and spatial dimensions at all stages of database processing is developed. A case study of a large commercial database is used to illustrate the application of the database locality model and the interpretation of results.<>
{"title":"A temporal and spatial locality theory for characterizing very large data bases","authors":"A. Moulton, S. Madnick","doi":"10.1109/HICSS.1989.48040","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48040","url":null,"abstract":"Theoretical results in formally defining and measuring database locality are presented. Database locality has proved less tractable than program locality, which has a long history of theoretical investigation and application in virtual memory systems and processor catches. The stages at which database locality can be observed and the differences between database and program locality are identified. A technique for adapting the program locality model to both temporal and spatial dimensions at all stages of database processing is developed. A case study of a large commercial database is used to illustrate the application of the database locality model and the interpretation of results.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126474056","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 : 1989-01-03DOI: 10.1109/HICSS.1989.48086
D. Baldwin
CONSUL is a prototype constraint-based programming language for multiprocessors. Parallelism in CONSUl programs is intended to be detected by compilers instead of being explicitly coded by people. Initial results from an experiment to study the parallelism available from real CONSUL programs are described. The experiment estimates the parallelism that is inherent in the language, independent of overheads introduced by specific implementations, machines, or run-time environments. The resulting numbers are thus an upper limit on the parallelism that real implementations can be expected to deliver. Measurements have been made on several simple programs, with overall speedups due to parallelism ranging from 2 to over 50.<>
{"title":"Preliminary estimates of parallelism in CONSUL programs","authors":"D. Baldwin","doi":"10.1109/HICSS.1989.48086","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48086","url":null,"abstract":"CONSUL is a prototype constraint-based programming language for multiprocessors. Parallelism in CONSUl programs is intended to be detected by compilers instead of being explicitly coded by people. Initial results from an experiment to study the parallelism available from real CONSUL programs are described. The experiment estimates the parallelism that is inherent in the language, independent of overheads introduced by specific implementations, machines, or run-time environments. The resulting numbers are thus an upper limit on the parallelism that real implementations can be expected to deliver. Measurements have been made on several simple programs, with overall speedups due to parallelism ranging from 2 to over 50.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115497627","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 : 1989-01-03DOI: 10.1109/HICSS.1989.48020
Luqi
Concepts and mechanisms for handling the real-time constraints of embedded software systems in rapid prototyping are presented. Rapid prototyping of embedded systems can be accomplished using a computer-aided prototyping system, CAPS, and its associated prototyping language PSDI. This system and language are used to aid the designer in the early stages of software engineering for hard real-time systems. Such systems contain time-critical operations with maximum execution times, maximum response times, and minimum calling periods. Interrupt handling, synchronization, and periodic behavior are also described at a high level. Time-critical operations in a real-time prototype are handled by constructing static and dynamic schedules to coordinate execution and to meet the required prototype execution times. The mechanisms for expressing timing constraints in PSDL are described along with their effects on the schedulers.<>
{"title":"Handling timing constraints in rapid prototyping","authors":"Luqi","doi":"10.1109/HICSS.1989.48020","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48020","url":null,"abstract":"Concepts and mechanisms for handling the real-time constraints of embedded software systems in rapid prototyping are presented. Rapid prototyping of embedded systems can be accomplished using a computer-aided prototyping system, CAPS, and its associated prototyping language PSDI. This system and language are used to aid the designer in the early stages of software engineering for hard real-time systems. Such systems contain time-critical operations with maximum execution times, maximum response times, and minimum calling periods. Interrupt handling, synchronization, and periodic behavior are also described at a high level. Time-critical operations in a real-time prototype are handled by constructing static and dynamic schedules to coordinate execution and to meet the required prototype execution times. The mechanisms for expressing timing constraints in PSDL are described along with their effects on the schedulers.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115731696","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 : 1989-01-03DOI: 10.1109/HICSS.1989.48110
H. Hausen
A modeling technique is proposed that uses weight functions to define factors of quality or productivity in terms of evaluation factors. As a result, an acyclic decomposition graph is obtained. Quality or productivity is then defined as the distance between the actual graph and a required graph. An assessment technique is proposed that permits decompositions of any reasonable depth. It is shown how specific models are to be generated by a set of elementary production rules. The approach proposed is also applicable to modeling cost or volume estimations.<>
{"title":"Yet another software quality and productivity modeling-YAQUAPMO","authors":"H. Hausen","doi":"10.1109/HICSS.1989.48110","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48110","url":null,"abstract":"A modeling technique is proposed that uses weight functions to define factors of quality or productivity in terms of evaluation factors. As a result, an acyclic decomposition graph is obtained. Quality or productivity is then defined as the distance between the actual graph and a required graph. An assessment technique is proposed that permits decompositions of any reasonable depth. It is shown how specific models are to be generated by a set of elementary production rules. The approach proposed is also applicable to modeling cost or volume estimations.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124078093","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
扫码关注我们
求助内容：
应助结果提醒方式：