Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications

7-9 March 1990

Filter Results

Displaying Results 1 - 25 of 122
  • PARBASE-90 International Conference on Databases, Parallel Architectures and Their Applications (Cat. No.90CH2728-4)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (24 KB)
    Freely Available from IEEE
  • Conformance of Chinese text to Zipf's law

    Publication Year: 1990
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    An investigation was carried out to determine whether Chinese text material conforms to Zipf's law. The information reservoir for this particular investigation contains 2,022,604 Chinese ideograms. It is shown that single Chinese characters do not conform to Zipf's law; however compound words are found to conform well. In addition, examining the regression analysis for compound words implies a goo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconfigurable systolic architectures for hashing

    Publication Year: 1990
    Cited by:  Papers (1)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    The authors develop a novel technique in which concepts of both bucketing and open addressing schemes are modified in such a manner that they can be suitable for VLSI/WSI implementation, namely, dynamically reconfigurable hash tables. In this method, finite storage is allocated for each bucket. Instead of searching the entire table or a part of the table for an empty storage place, the overflowing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs

    Publication Year: 1990, Page(s):293 - 301
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    The authors present an adaptive parallel algorithm for the assignment problem on complete weighted bipartite graphs, where the edge weights can be real valued and negative. The algorithm is designed using the exclusive-read, exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a complete weighted bipartite graph of n vertices, the algorithm runs in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimistic multi-level concurrency control for nested typed objects

    Publication Year: 1990
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    The authors propose an optimistic multilevel method that also exploits commutativity of typed operations in order to enhance concurrency. One of the main advantages of this method is that it makes it possible to take commutativity depending upon return values into account. A bank-transaction example illustrating the proposed approach is presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel architectures and object-oriented databases

    Publication Year: 1990
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Research into object-based concurrency and parallel architectures is briefly described. A multiprocessing, object-oriented database programming language and environment called RAPP has been designed and implemented, and is based on a tight integration of the relational data model and the object-oriented data modeling facilities of a modular, multiprocessing programming language. Persistence is pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional Fourier transforms by systolic architectures

    Publication Year: 1990, Page(s):284 - 292
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    A method of formal transformation of a multidimensional DFT (discrete Fourier transform) algorithm to a form suitable for implementation with a systolic macropipeline is discussed. The suggested transformation of the original form of the DFT algorithm consists of one or several rotationlike transforms applied to the index set. The resulting `completely systolized' form of the algorithm makes it po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending n-version programming to concurrent software

    Publication Year: 1990
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB)

    The authors propose three different constructs which extend the n-version programming (NVP) concept to concurrent NVP (CNVP): process-dissimilar CNVP, subprogram-dissimilar CNVP, and structure-dissimilar CNVP. Each of these three constructs is a corollary to one of the three concurrent recovery block constructs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On modelling a type of communications in some communications intensive applications

    Publication Year: 1990
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    The author considers the problem of modeling a type of communications in some communications-intensive applications such as the parallel sort algorithm and parallel computation of the transitive closure of binary relations. The special characteristics of this type of communications are (1) every site will exchange (receive and transfer) the information with all the other sites, and (2) each site c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant multiprocessor networks through an extended G-network

    Publication Year: 1990, Page(s):216 - 220
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    The authors present an extended G-network which is 3-insensitive, meaning that the network can tolerate up to three communication link failures. It is shown that the extended G-network still keeps the characteristics of the G-network: efficient routing, a small number of links, a small number of file servers, and fault tolerance. The performance of the extended G-network is compared to that of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting temporal capabilities in a multicomputer database system

    Publication Year: 1990, Page(s):20 - 26
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    The authors describe how an existing multicomputer database system, known as RRDS (relational replicated database system), can be extended to support temporal databases. The tuple-versioning approach to temporal databases and a query modification scheme are used to build a TRRDS (temporal RRDS) on top of the RRDS. Seven temporal extensions are presented for the TRRDS. The modifications required to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reverse data engineering of E-R-designed relational schemas

    Publication Year: 1990, Page(s):438 - 440
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    A novel solution is presented for the data engineer's inverse mapping problem: to construct from a relational database schema (RDBS) a corresponding entity-relationship diagram (ERD). The inverse mapping is difficult because many ERDs may correspond to one ERDs, or to none if the schema is not well formed, so it is not clear how to define a mapping in this direction. Nonetheless, it would be desir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation and evaluation of a parallel PMS simulator

    Publication Year: 1990, Page(s):408 - 416
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    The sources of parallelism in an event-driven simulator have been investigated. First, a simple and straightforward parallelization strategy was implemented. It was observed that this strategy did not provide sufficient parallelism. Then the advance scheduling strategy was developed, which has yielded a significantly higher degree of parallelism. The main contribution of this research has been the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient multiprocessor merge algorithm

    Publication Year: 1990, Page(s):276 - 283
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    An efficient algorithm for merging two memory-resident sorted lists is described. The algorithm is based on a novel low-cost partitioning algorithm that is used to split the two lists among an arbitrary number of processors in a way that ensures load balance during the merge. The algorithm has direct applications in memory-resident databases, as well as for handling record pointers in disk-residen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Massively parallel implementation of two operations: unification and inheritance

    Publication Year: 1990, Page(s):505 - 509
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    The author develops two algorithms for a massively parallel system, and SIMD (single instruction, multiple data) computer with a general and fast communication network. Each of the two operations (unification and inheritance) is basic for one knowledge representation scheme. Both take data represented by directed graphs. For ease of integration in real systems and naturalness of specification, the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message-passing database machines

    Publication Year: 1990
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    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 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic addressing

    Publication Year: 1990
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    The author explores the question of whether computer networks can be made to determine who should receive the messages they carry more efficiently than their human users. Some elements of a possible answer to this question are provided. A protocol for semantic addressing based on partitioning methods borrowed from the field of information retrieval is developed. Use of the protocol has been simula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throttling and speculating on parallel architectures

    Publication Year: 1990, Page(s):2 - 4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Throttling of parallelism is of importance to dynamic parallelism models in which the number and sizes of possible parallel code segments (tasks, processes, threads, etc.) are unknown at compile time, and which, if left uncontrolled, may lead to explosive parallelism with resulting slowdown rather than speedup. The primary goal of throttling is preventing a dynamically unfolding parallel execution... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Associative memory designs for VLSI implementation

    Publication Year: 1990, Page(s):359 - 366
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    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 a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding shuffle networks in hypercubes

    Publication Year: 1990, Page(s):466 - 468
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    The author addresses the problem of embedding shuffle networks in hypercubes. The embedding of perfect shuffle and shuffle exchange networks is considered. Embedding schemes with different tradeoffs between dilation and expansion are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New designs for priority queue machine

    Publication Year: 1990, Page(s):123 - 128
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    Two novel designs for performing a group of priority queue operations on a set of elements are presented. Processors in either design are connected together to form a linear chain. The first machine, called a binary heap machine, is based on a heap data structure. The algorithms for XMAX and INSERT operations are different from their sequential counterparts in that they both perform the restructur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal fault-tolerant broadcasting algorithm for a cube-connected cycles multiprocessor

    Publication Year: 1990, Page(s):206 - 215
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The author develops a novel broadcasting algorithm in cube-connected-cycles (CCC) multiprocessors using a binomial tree. The initiating processor takes [h-1/2]+s (1+[h-1/2]) steps to broadcast the message to all other processors. The proposed broadcasting algorithm is a procedure by which a processor can pass a message to all other processors in the network nonredundantl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structured data in structured logic programming environment

    Publication Year: 1990
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    EPSILON, a prototype developed in the context of the European ESPRIT project, is discussed. It is built on top of a commercial Prolog and DBMS (database management system) running on standard UNIX environment. The EPSILON logic programming environment allows the structuring of large knowledge bases expressed in logic languages using so-called theories. The integration of different object-oriented ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capture database semantics by rule induction

    Publication Year: 1990
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    To capture database characteristics, a knowledge-based entity-relationship (KER) model is proposed to extend the basic ER model by P.P.S. Chen (see ACM Trans. Database Syst., vol.1, no.1 (1976)) to provide knowledge specification capability. The knowledge specification capability allows database characteristics to be specified and maintained with each object definition. In the KER model, each enti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The architecture and implementation of ENLI: example-based natural language-assisted interface

    Publication Year: 1990, Page(s):430 - 432
    Cited by:  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    The architecture and implementation of a user interface called ENLI are presented. The interface supports an English-like query language. It is easy to implement and avoids problems in building natural language interfaces. Its core component consists of two translators, from ENLI to QBE and from QBE to SQL. ENLI considers several aspects of man-machine interaction. It supports different levels of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.