By Topic

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

Date 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
  • On-the-fly processing of continuous data streams with a pipeline of microprocessors

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

    A pipeline of microprocessors which is able to perform substantial on-the-fly transformations with large amounts of data has been developed. The general concept is a pipelined structure for associative processing. This structure is based on the use of a long sequence (pipeline) of identical, relatively simple associative pattern matching/transforming elements. The associative pipeline achieves hig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel computing system with communication memory

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

    The authors describe a parallel computing system architecture in which the processors' access to common data is combined with the memory read/write operations. This can be achieved by the division of the memory into individual modules constituting the communication memory. Only data which are used by at least two processors of the parallel computing system are written into the memory. The communic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending object-oriented databases with rules

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

    Rules have been adopted as a means of expressing knowledge which is uniform throughout the type lattice but needs to be customized for each object type with integrity constraints. More specifically, such knowledge involves associations between instances, between objects, and between objects in different databases; grouping of instances; creation and deletion of object instances; and any other acti... 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.
  • Choosing a leader on a hypercube

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

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Molecular dynamics on transputer arrays

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

    The implementation of a molecular dynamics simulation on a 10 transputer system is reported. The implementation exploits fully the geometric parallelism of the problem. A simple model of the computing and communications overheads leads to predictions of the optimal scaling of the problem size with the number of processors. The implementation exploits fully the domain decomposition paradigm in whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending and configuring the PRIMA database management system kernel

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

    The authors give an overview of the mechanisms used in a specific DBMS (database management system) kernel, PRIMA, to easily extend and configure the system in advance, as well as on-line. They discuss four kinds of extensions: (1) schema extensions, that is, on-line addition and removal of object types and attributes without nasty data reorganization; (2) data model extensions, which allow for th... 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.
  • Concurrent message passing in communicating sequential processes

    Publication Year: 1990, Page(s):76 - 84
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    The authors examine a model of concurrency among concurrent sequential processes with asynchronous message sending done using ordinary and FLUSH message passing primitives. Using two paradigms, the authors show that FLUSH primitives permit more accurate modeling of problem situations than synchronous message passing. They also show that FLUSH message passing primitives allow for a greater concurre... 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.
  • 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.
  • Distributed database architectures

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

    The characteristics of distributed database architectures are discussed. It is noted that the advent of powerful modeling facilities, such as object-oriented and knowledge-based data models, has paved the way for a complete reconsideration of several of the long standing assumptions and perspectives that are pervading the field of distributed database architectures. It is now possible to propose n... View full abstract»

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

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

    It is noted that the existing approaches to net refinements have the disadvantage that the final schema net remains flat (like a program developed by step-by-step refinement) and the higher level nodes of the net disappear or all nodes of all levels remain on one level in the final schema. The author proposes a refining constraint and procedure which determines a net hierarchy as a real hierarchy ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing and multiprogramming in the Flagship Parallel Reduction Machine

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

    Investigations into load balancing and multiprogramming for a multiprocessor supporting declarative programming are reported. The Flagship Parallel Reduction Machine uses a packet-based graph reduction model of computation to exploit the parallelism in functional languages. The abstract architecture comprises a set of closely coupled processor-store pairs connected by a multistage delta communicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • A view based near optimal design of pointer access structures in relational databases

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

    A methodology for choosing pointer access structures for a relational database is proposed. The methodology is based on the usage patterns of the database that are represented as views. The pointer access structures can be simple access structures, such as circular chains, pointer indexes, chains, and tree indexes, as well as compound access structures, such as a tree index pointing to a set of po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-space optimal parallel set operations

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

    The authors present parallel algorithms for the elementary binary set operations that, given an EREW PRAM (exclusive-read, exclusive-write parallel random-access memory) with k processors, operate on two sorted lists of total length n in O(n/k+log n) time and O(k) extra space, and are thus time-space optimal for any fixed value of k&le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic scheduling of DOACROSS loops for multiprocessors

    Publication Year: 1990, Page(s):66 - 75
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    The authors address the problem of parallel execution of DOACROSS loops with complex inter-iteration dependences. Rather than treat the scheduling of such loops and their synchronization as distinct and separable issues, the authors treat synchronization and scheduling in a unified framework. The resulting approach is referred to as presynchronized scheduling. The approach is illustrated in the co... 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 operational approach to the integration of distributed heterogeneous environments

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

    The OIS (Operational Integration System) data model and query language are presented. The main goal of OIS is to provide the application environments with a uniform interface for accessing data managed by heterogeneous systems. Conceptually, OIS can be depicted as a three-level system. The integration data model level allows distributed applications to be coded in object-oriented style. The operat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of immediate-update and workspace transactions: serializability and failure tolerance

    Publication Year: 1990, Page(s):331 - 340
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    A theoretical study of concurrency control and failure tolerance which includes both immediate-update (IU) and workspace (WS) transactions is presented. All previous formal approaches only consider IU transactions. A WS transaction first reads objects and updates them only in its private workspace; the objects are written only after the WS transaction commits. In order to examine execution correct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The outstanding problem for today's database technology

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

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient, reference weight-based garbage collection method for distributed systems

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

    A method of distributed garbage collection using reference counting has been developed previously by D.I. Bevan (1987). This method is correct but has one severe drawback: the time overhead caused by the use of indirection cells. The authors describe an alternative: the reference weight table method. It is shown that this method does not suffer from as much time overhead and offers general improve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel processing of deductive databases on a commercial multiprocessor

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

    A processing strategy for large knowledge bases, which features large granularity of computation because it works with relations, has been proposed. The performance behavior of this strategy was tested on a parallel processor; specifically, it was implemented on a Sequent Symmetry S81. The data-partitioning parallelization approach was used. Experimental results show that real problems have unbala... View full abstract»

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