{"title":"Algebraic properties of some parallel processor interconnection networks","authors":"S. Yalamanchili, J. Aggarwal","doi":"10.1109/ICDE.1984.7271326","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271326","url":null,"abstract":"Interconnection networks form an integral part of parallel processing systems, providing the facility for communication between several concurrently executing tasks. This paper presents an algebraic characterization of the sets of communication paths that a network can simultaneously establish between the processing elements of the system. This characterization provides a uniform framework for the analysis of interconnection networks and is shown to yield answers to several important questions concerning the capabilities, limitations and operation of these networks. The networks considered include one way and two way shift register rings, near neighbor meshes, single stage switching networks and briefly, multistage switching networks.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131885684","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":"Guardian: Decentralized control of an embedded multimicroprocessor","authors":"A. V. Tilborg","doi":"10.1109/ICDE.1984.7271296","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271296","url":null,"abstract":"Guardian is a real-time, multimicroprocessor operating system intended to be a research testbed for experimentation with decentralized control. It was designed in a Pascal-like language for a target multimicroprocessor that contains six microcomputer processing elements and twelve shared memories fully interconnected by a crossbar switch. Each processing element in the host multimicroprocessor executes Gaurdian tasks that perform shared memory reclamation, internodal communication, health monitoring, task scheduling, fault containment, and distributed debugging. Each node also supports application-callable software primitives for realtime process control, message-based interprocess communication, shared data structure management, and exception handling. The primary goal of Guardian is to demonstrate hard real-time decentralized control of an embedded multimicroprocessor.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124621304","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":"Practical application of IDEF1 as a database development tool","authors":"K. L. Ruoff","doi":"10.1109/ICDE.1984.7271300","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271300","url":null,"abstract":"This paper describes the IDEF1 information modeling technique, its key concepts, modeling approach, rules, and graphical notation. A step-by-step example is presented, which illustrates use of IDEFl as a conceptual database development tool. The example demonstrates the four phases of IDEFl model development, concentrating on the modeling process and its application to a typical information modeling problem. The paper also discusses aspects of conceptual database development that IDEFl does not support.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123100084","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 CMS-HELP expert system","authors":"D. Yun, David Loeb","doi":"10.1109/ICDE.1984.7271307","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271307","url":null,"abstract":"An expert system known as CMS-HELP has been developed to serve as an on-line consultant to users of the VM/CMS opening system. It assists computer users (novice or experienced), who attempt to use unfamiliar system facilities, by giving prompt advice of a sequence of commands to accomplish a desired user task. The domain for CMS-HELP is the collection of CMS command modules and EXEC's at IBM Research. This set of command facilities is treated as data by the expert system. The source of knowledge is mainly provided by the command descriptions and system consultants, who are expert users of these commands. This expert system exemplifies data/knowledge engineering to develop an intelligent agent capable of providing on-line consultation. Thereby, the system serves important functions to both the developers and the users of CMS commands: it makes the programs more usable and understandable and it makes the users more productive and receptive. Thus, the system brings data/knowledge and its users closer together.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129583868","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":"Fixed length semiorder preserving code for field level data file compression","authors":"Motomichi Toyama, S. Ura","doi":"10.1109/ICDE.1984.7271278","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271278","url":null,"abstract":"An encoding scheme (FLSOPC) is presented as a new data compression method. The generated fixed-length codes are preserving the order on the original data representations in the sense of semiorder preservation as defined in this paper. The FLSOPC employing binary sectioning assignment algorithm requires the code size that is linear to logarithm of the data cardinality. It is about 2.8 times that required by FLMB (fixed-length minimum bit) encoding when no knowledge about data is given a priori. This factor can be reduced to 2.1 if a half of data has been available as the initial load and approaches 1 when even more data is known.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115127375","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":"Feedback stabilization of control policy selection in data/knowledge based systems","authors":"C. Starmer","doi":"10.1109/ICDE.1984.7271322","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271322","url":null,"abstract":"Knowledge and/or data-based decision support systems can be viewed as complex control systems designed to optimize a desired criterion. As such, they aid users in transforming objects with an initial state vector to some desired outcome state by application of a suitable control policy. System effectiveness can be measured by the number of decision errors. Completeness and validity of the knowledge base can be facilitated by coupling a database of instances of system use with the implementation of the knowledge base. Instances of system use are viewed as traces which should be consistent with the knowledge base. The database contains records characterizing each instance of system use (a trace) and includes the state vector of the object being controlled, the selected control strategy, and the resultant outcome state vector. Stability of control policies is improved within the decision process by incorporating a feedback data path that is derived from actual outcomes resulting from application of a control policy.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115148225","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 comparison of parallel language approaches to data representation and data transferral","authors":"C. Cline, H. Siegel","doi":"10.1109/ICDE.1984.7271255","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271255","url":null,"abstract":"Recent progress in integrated circuit technology has made parallel processing a practical method for dealing with large-scale computational problems. A wide variety of parallel architectures have been proposed. Many different languages have been developed for use on these architectures, with various conventional languages being the base language. The ways in which these parallel languages approach the problem of data management are discussed. Methods of data transferrai and their relationship to the underlying architectures are examined. Transferrai among processor memories and between primary and secondary memory will both be discussed. Data allocation among processor memories will also be described.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133150449","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 role for data analysis in practical requirements definition","authors":"R. P. Zimmerman","doi":"10.1109/ICDE.1984.7271211","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271211","url":null,"abstract":"Many DP managers and analysts are familiar with \"Structured Systems Analysis\" made famous by Gane, Sarson, DeMarco, and others. A number of organizations credit its concise, partitioned diagrams with helping them build successful systems. However, since its introduction in the mid-1970's some of the criteria for effective systems have changed. Clients expect more for their money than systems that perform close to an agreed specification. They also expect built-in flexibility so that future, unanticipated uses of related information can be provided to them inexpensively.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116557669","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":"Transaction workload evaluation in the Codasyl database environment","authors":"S. Orlando, P. Rullo, W. Staniszkis","doi":"10.1109/ICDE.1984.7271319","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271319","url":null,"abstract":"General architecture of a transaction workload analyzer for the Codasyl DBMS environment is presented. The proposed solution is discussed in the framework of general performance problems typical for a Codasyl database environment. Major functions of the Workload Analyzer such as the data manipulation algorithm analysis, the DML statement expansion and the cost model underlying the workload evaluation are described.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116654207","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 method for optimization of a conceptual model","authors":"Ole Oren","doi":"10.1109/ICDE.1984.7271264","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271264","url":null,"abstract":"Optimization of a conceptual model is a non-trivial task. A set of rules for determining the \"best\" one out of a number of candidate solutions is introduced. A key point is the definition of a set of quantifiable characteristics of a conceptual model; a measurement of the characteristics together with a fixed measurement of the decision-maker's preferences are used to quantify the quality of the candidate solutions relative to each other. The chosen characteristics are: size, change pr. month, data description inaccuracy, semantic relevance, semantic inaccuracy and l/0-model size.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125672505","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}