By Topic

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
  • Use of mesh connected processors for realizing fault tolerant relational database operations

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

    The authors present algorithms for relational database operations using mesh connected processors. An important feature of these algorithms is that they are fault tolerant, that is errors in computation that may arise owing to either permanent or transient failure in a single processor are detected and corrected. These algorithms are immediately useful for main memory databases. Data elements for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performing logical database design using an E-R graph rewriting system

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

    The authors present a formalism which restricts the freedom of connecting different entity-relationship constructs so that only syntactically and semantically well-formed diagrams can be designed. The methods used in this formalism are graph rewriting for the generation of conceptual structures, string rewriting for graph markings, and assertions for establishing the semantic correctness of the ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time classification of chromosomes in slit scan flow cytometry using NERV-a MIMD supercomputer

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

    Presently, profile evaluation can be done at a rate of 10 chromosomes/s using the reflection algorithm. To measure, for example, radiation-induced aberrations in the low dose range or to sort chromosomes according to their slit scan data, it is desired that the analysis speed increase by a factor of 100. It is shown that the data analysis rate allowed by the on-line computer may be increased by im... 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.
  • Future architectures for information processing systems

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

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The semantics of commutativity in the execution of concurrent transactions

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

    It is pointed out that a precise understanding of user process semantics is crucial to the design of schedulers for concurrent transactions. Although a scheduler that is at least sufficient to maintain database correctness must be designed, a more precise understanding of user process semantics will make it possible to identify and make use of additional properties maintained by the scheduler and ... 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.
  • Transform a NIAM conceptual schema into a EKNE relational database scheme

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

    A system for enhancements of semantic methodologies for relational database design is described. In order to design a well-formed NIAM conceptual schema, dependency theory can be used as a heuristic tool to help the designer detect the derived fact types (FTs) in the NIAM conceptual schema. In order to design a minimal relational database schema, one can use dependency theory as a heuristic tool t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A time-stamp based concurrency control mechanism for redundant computing systems

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

    The use of shuffled execution systems to construct redundant executing systems is considered. The following two problems connected with the implementation of this method are discussed: (1) how to combine normal operations and voting operations and how to return to the normal situation when voting operations fail; and (2) how to apply timestamp ordering techniques to the system model 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.
  • 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.
  • Specification of synchronization by means of constraints

    Publication Year: 1990, Page(s):479 - 484
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    A synchronization model based on the expression of global constraints and on a method of managing them is presented. After this approach is justified, a model for constraints management which allows compounded operations to be taken into account is described. The power of this model is illustrated on parallel control structures such as plain or complex rendezvous; priority and fairness are analyze... 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.
  • 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.
  • 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.
  • Using SIMD parallelism to support rule-based systems

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

    A parallel algorithm for the implementation of Rete networks on a parallel array processor is proposed. Although special-purpose architectures have been proposed for directly implementing production systems, the availability of such machines is very limited. Proposed implementation algorithms, which take advantage of more widely available parallel machines, are more practical. Such an approach was... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and simulation of multistage interconnection networks under non-uniform traffic

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

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

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

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

    It is shown that the use of an adjusted algorithm can improve the performance of a nested query execution containing join operations. Apart from the equijoin, the union, Cartesian product, Θ-join, and intersection operations can be implemented in a pipelining way. The difference, however, cannot be implemented in this way. The proposed algorithms are implemented in PRISMA/DB View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aftran: Array Fortran programming language

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

    The Aftran programming language is an extension of Fortran 77, which incorporates many of the array processing capabilities of the new Fortran 8x language. This language allows programmers to write code for vector and array processors which can also be executed on standard scalar computers. Thus, a programmer can develop programs on inexpensive workstations which will execute efficiently on vector... 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.
  • Sorting and joining relations with duplicate attribute values

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

    The computational complexity of sorting and joining relations with duplicates is investigated. The measure of complexity is the number of three branch comparisons needed to process these operations. A relation is characterized by its cardinality n and the number of distinct elements L in the attribute columns of interest. Under this characterization, the worst time complexity of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel transitive closure and transitive reduction algorithms

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

    The authors provide distinct algorithms for computing transitive closure and transitive reduction with sequential time complexities of O(Σei) and O(n2ei), respectively, and parallel time complexities of O(ei) And O(n +ei), respectively. The proposed transitive closure algorith... 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.
  • A predicate-calculus based language for semantic databases

    Publication Year: 1990, Page(s):424 - 429
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    The author proposes a nonprocedural language for semantic databases in general and for the semantic binary model in particular. The foundation of the language is a database interpretation of a first-order predicate calculus. The calculus is enriched with second-order constructs for aggregation (statistical functions), specification of transactions, parameterized query forms, and other uses. The la... View full abstract»

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