{"title":"Analysis and simulation of multistage interconnection networks under non-uniform traffic","authors":"S. Chalasani, A. Varma","doi":"10.1109/PARBSE.1990.77150","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77150","url":null,"abstract":"The performance of multistage interconnection networks is known to degrade severely with nonuniformities in the traffic distribution. On the basis of simulation and analysis, the authors study the effect of nonuniform traffic patterns simulation and analysis when two multistage networks are used in parallel to interconnect processors and memory modules in a shared-memory system. The networks considered are identical copies of buffered multistage networks. The authors consider the following two strategies for distributing the total traffic between the two networks and study the conditions under which each strategy is effective: (1) distribute the traffic randomly among the networks; (2) route the nonuniform component of the traffic to one network and the uniform component to the other. They also derive approximate analytical expressions for the time taken for tree saturation to occur with a single hot spot and the time taken for recovery when the hot spot disappears.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"431 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122872852","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":"Inference techniques for fault tolerant distributed database systems","authors":"W. Chu, A. Y. Hwang","doi":"10.1109/PARBSE.1990.77146","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77146","url":null,"abstract":"A data inference approach to increase data availability in distributed database systems is proposed. When the requested data are not accessible owing to network and/or site failures, the database system can infer or approximate them from other accessible database fragments. Two different levels of correlated knowledge are used for inference. In the schema level, correlated knowledge between objects is represented as inference paths. Further, in the instance level, correlated rules are used to represent their detail correlations. In general, inference paths suggest proper objects and directions for data inference. By the selection of proper inference paths, correlated rules can be used to derive the inaccessible information. It is noted that a data inference system can be implemented as a front-end system to an existing distributed database system. It consists of a database fragment availability table which provides the data accessibility information for each site, the inference engine that selects inference paths and rules for inferring unavailable data, and the query modification system which transforms the given query to an alternate one such that all the required database fragments are accessible.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"85 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117295292","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":"Modeling interconnection networks using a hardware description language","authors":"L. Freytag","doi":"10.1109/PARBSE.1990.77203","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77203","url":null,"abstract":"Using a hardware descriptive language, it is possible to develop simulation models for processor interconnection networks which take hardware considerations into account during simulation. Models were produced for nine interconnection networks, specialized first for a simple algorithm, then adapted for a more complex task. Simulations were conducted to ensure the correctness of the models, and the complexities involved in expanding the simple example into the more complex one were considered. In particular, simulation results obtained with the DABL (Daisy Behavioral Language) model are presented. The DABL models were capable of providing more insight into hardware-related issues than simulations conducted in conventional programming languages.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125389373","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":"KIWIS: advanced knowledge-base environments for large database systems","authors":"E. Laenens, D. Vermeir","doi":"10.1109/PARBSE.1990.77171","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77171","url":null,"abstract":"The authors present an overview of the functionality and the architecture of KIWIS, a federated knowledge-base environment based on deduction in an object-oriented framework. A KIWIS environment consists of a number of participating KIWIS systems, each of which may be connected to one or more external databases. The architecture of each component system is composed of a number of layers that incrementally add power to this system. The kernel of a system consists of layers 1 through 4 and creates the 'personal knowledge machine' environment. The other layers (5 and 6) act as a 'window on the world', enriching the local system knowledge with external knowledge.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124110042","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":"Message-passing database machines","authors":"L. Bic","doi":"10.1109/PARBSE.1990.77197","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77197","url":null,"abstract":"The development of message-passing database machines is briefly examined, with emphasis on the Active Graph Model (AGM). The AGM, developed specifically to exploit massive parallelism, is based on the principles of purely message-driven computation, where the entire database is represented as a graph of communicating nodes. Unlike object-oriented models, however, where the programmer must provide the methods for message handling, in AGM, generic methods are an inherent part of the model. This results in a much finer grain of parallelism than is obtained with object-oriented systems. Since both memory and control are encapsulated within each node, the database is capable of exploiting an architecture consisting of a very large number of loosely coupled processors and disk units. A hardware prototype consisting of 16 processors and 16 disks is now operational.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122620592","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":"Future architectures for information processing systems","authors":"G. Wiederhold","doi":"10.1109/PARBSE.1990.77138","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77138","url":null,"abstract":"The author considers the functions that are necessary to create information at the level of effective decision making. He observes that a major portion of the task has not yet been formalized and carried out by conventional programs. He outlines a layered architecture that incorporates modules that will implement the objective of moving processing out of traditional programs. These software modules or mediators exploit encoded knowledge about some sets or subsets of data to create information for a higher layer of applications. The author discusses the interfaces that will be needed to incorporate mediators in future information processing systems architectures. A number of research issues are raised.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122625812","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}
N. Prabhakaran, C. Baru, D. Batory, D. K. Hsiao, H. Jagadish, C. Pu, S. Navathe
{"title":"The outstanding problem for today's database technology","authors":"N. Prabhakaran, C. Baru, D. Batory, D. K. Hsiao, H. Jagadish, C. Pu, S. Navathe","doi":"10.1109/PARBSE.1990.77151","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77151","url":null,"abstract":"The paper constitutes the proceedings of a panel in which distinguished researchers from academia and industrial research organizations were invited to identify the crucial problem for today's database technology. C.K. Baru notes that the outstanding problem for today's database technology is the exploitation of available and anticipated hardware to provide efficient support for the processing of current and proposed data models employed at the conceptual level. D. Batory points out that object-oriented DBMSs (database management systems) offer a tight coupling of programming languages with database systems; extensible DBMSs offer the ability to customize and optimize the internals of a DBMS to suit specific application. He believes that these combined technologies offer the ideal system of the future. D. Hsiao examines problems in database software and database hardware. H.V. Jagadish points out that faster access, greater functionality, and better interfaces have been and will continue to be important goals for any database system. C. Pu notes that choosing the operating system for the development of a new database management system has always been a difficult tradeoff between overhead and portability. Finally, S. Navathe suggests that database research has not paid enough attention to the needs of the consumers of data.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123268232","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":"Choosing a leader on a hypercube","authors":"S. Robbins, K.A. Robbins","doi":"10.1109/PARBSE.1990.77181","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77181","url":null,"abstract":"The problem of electing a leader via message passing on a network is a fundamental problem in distributed processing. The authors present a simple algorithm for election of a leader on a hypercube with n nodes in O(n) messages.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131447659","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":"Associative memory designs for VLSI implementation","authors":"B. Parhami","doi":"10.1109/PARBSE.1990.77161","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77161","url":null,"abstract":"The author proposes systolic architectures for associative memories, resulting in systems whose performance parameters are realistically independent of size for long sequences of operations with proper optimization of instruction sequencing. The designs are based on well-known principles of pipelining and systolic operation using a collection of small building-block associative memories. Several alternative organizations, from a simple linear array to higher dimensional meshes and trees, are examined and evaluated with respect to cost and performance. The proposed architectures should lead to practical VLSI realizations of large associative memories, which would be impossible to implement under the 'operand-broadcasting' and 'reduction-by-wired-logic' paradigms.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130576395","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":"Database partitioning techniques to support reload in a main memory database system: MARS","authors":"L. Gruenwald, M. Eich","doi":"10.1109/PARBSE.1990.77125","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77125","url":null,"abstract":"The authors examine the effect of different partitioning techniques on the MMDB (main memory database) reload problem in terms of the number of I/Os for reload and number of MM references during transaction processing. The best technique is the one that yields the minimum overall cost with regard to both properties. It is shown that horizontal and single vertical partitioning are actually the only possible candidates. Physical vertical never yields the best result. In some very rare cases, group vertical outperforms the other techniques. If the database system encountered performs more selections than projections and joins, and more tuple modifications or tuple deletions than tuple insertions, then horizontal is the best technique. Otherwise, single vertical is the chosen technique. It is also shown that, if reload is the only concern, that is, if the transaction performance is not taken into account, then single vertical is always the best choice.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133834012","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}