[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems

4-6 Dec. 1991

Filter Results

Displaying Results 1 - 25 of 43
  • Proceedings of the First International Conference on Parallel and Distributed Information Systems (Cat. No.91TH0393-4)

    Publication Year: 1991
    Request permission for commercial reuse | PDF file iconPDF (100 KB)
    Freely Available from IEEE
  • Aspects of the BBFS broadband filesystem

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

    Summary form only given. As a consequence of improving technology, a new class of applications is emerging, characterized by intense demands on communications, computation, and data storage. BBFS is a broadband filesystem effort to explore ways of supporting these applications. A goal of BBFS is to simplify applications by absorbing data-intensive processing into the filesystem. To obtain behavior... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The papyrus integrated data server

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

    Summary form only given. The authors focus on the performance of integrated specialized data managers. In particular, they focus on the customizations of parallel executions of data manager operators in a variety of computer configurations. This is done by specifying the glue that connects data manager operators in a way that is independent of the computer configuration; and then providing the abi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Populating databases from multiple sources-the Hubble space telescope paradigm

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

    Summary form only given. The Hubble space telescope (HST) Ingest program reads files representing external database tables of any topology, normalizes or joins the tables to the HST catalog database topology, parses and converts data values, and writes the tuples to the HST catalog. Ingest is driven by translation tables defining the interdatabase mapping and can be altered on-the-fly. Ingest has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative visualization of computational fluid dynamics

    Publication Year: 1991
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (78 KB)

    Summary form only given. Interview is a computational fluid dynamics visualization application for which processing is distributed between high performance graphics workstations and supercomputers. Facilities are provided in the application for more than one user to view shared images creating a cooperative visualization environment. The way in which the computation is partitioned between the supe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ReSC: a distributed operating system for parallel and distributed applications

    Publication Year: 1991
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (83 KB)

    Summary form only. ReSC is a distributed operating system for both parallel/distributed applications and sequential applications. The hardware environment of ReSC is a set of shared-memory multiprocessors and uniprocessors which are connected to a high-speed local area network. To execute parallel/distributed application programs efficiently, those programs should control scheduling and mapping of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general tool for replicating distributed services

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

    Summary form only given. The authors are designing and implementing a tool for making certain types of distributed services highly available through replication. The project has three separable goals: (1) to provide a tool for developing highly available services by exploiting semantics to get good performance. (2) to understand the issues in building a correct, easy-to-use, generic replication to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NETMATE: management of complex distributed networked systems

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

    Summary form only given. The overall architecture of NETMATE is the following. Observation and Control Points (OCPs) are supported via managing agents placed in networked devices. These agents can monitor local device behaviors and affect device control functions, when instructed by a manager. Managers communicate observation/control requests to agents via a manager-agent protocol. Two protocol st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hardware and software architectural model for the manipulation of genetic databases

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

    Summary form only given. The authors describe a hardware and software architectural model for the characterization and analysis of genomes of select organisms. The data for research is obtained by semantically relating existing heterogeneous genetic databases. The authors have developed an architectural model based on associative memory structures at the hardware level and an object-oriented model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ELFS: object-oriented extensible file systems

    Publication Year: 1991
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (94 KB)

    Summary form only given. ELFS (an ExtensibLe File System), (1) provides high bandwidth and low latency I/O to applications programs on high performance architectures, (2) reduces the cognitive burden faced by applications programmers when they attempt to optimize their I/O operations to fit existing file system models, and (3) seamlessly manages the proliferation of data formats and architectural ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving throughput and functionality in a common architecture: the Datacycle experiment

    Publication Year: 1991
    Cited by:  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (75 KB)

    Summary form only given. The Datacycle database architecture is based on repetitive broadcast of database contents over high bandwidth channels and on-the-fly filtering of database contents to extract records of interest. These two mechanisms-high speed broadcast and on-the-fly filtering-result in a system that achieves the goals of high performance transaction processing, a powerful and flexible ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient data organization for parallel algorithmic design of cartographic database

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

    Summary form only given. The authors propose an efficient data organization for the storage and subsequent retrieval of large volume of cartographic data. The concept of address squares has been used extensively. The inherent parallelism in the data has been explored in order to improve computational efficiency. Several parallel algorithms related to the analysis of the cartographic data based on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing algorithms for parallel database processing on shared memory multiprocessors

    Publication Year: 1991, Page(s):210 - 217
    Cited by:  Papers (3)  |  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    This paper describes new load balancing algorithms for parallel database processing on shared memory multiprocessors. The goal of load balancing is to reduce overhead as well as load imbalance, but there is a tradeoff between them in ordinary algorithms. Unfortunately, optimum performance can hardly be obtained using ordinary algorithms because their performances depend on several factors such as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Policies for efficient memory utilization in a remote caching architecture

    Publication Year: 1991, Page(s):198 - 207
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    The high performance networks in modern distributed systems enable a site to obtain cached objects from the main memory of other sites more quickly than the time needed to access local disks. In this environment, efficient mechanisms can be devised to support rapid request/response exchanges for objects that reside on remote sites. As a result, it becomes possible to use remote memory as an additi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • I-CEM: an intelligent communication system for collaborative work

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

    The authors describe I-CEM (Intelligent-Communication System based on E-mail), a system designed for supporting computer-based communication when promoting collaborative work by multiple persons in a project team. Members in a project team often use formalized templates which imply the official information. Nevertheless these kinds of templates are suitable for storing and sharing among all the me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IDA-based redundant arrays of inexpensive disks

    Publication Year: 1991, Page(s):2 - 9
    Cited by:  Papers (2)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    The paper introduces the idea of using the Information Dispersal Algorithm (IDA) of M.O. Rabin (1989) to distribute data and redundancy information uniformly among multiple disks and compares the performance and reliability characteristics of shadowing, parity, and IDA. It discusses some ways to take advantage of the uniformity of data placement and argues that IDA is the algorithm of choice for a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Service interface and replica management algorithm for mobile file system clients

    Publication Year: 1991, Page(s):190 - 197
    Cited by:  Papers (23)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    Portable computers are now common, a fact that raises the possibility that file service clients might move on a regular basis. This new development requires rethinking some features of distributed file system design. The authors argue that existing approaches to file replica management would not cope well with the likely behavior of mobile clients, and they present their solution; a lazy server-ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical prefetching techniques for parallel file systems

    Publication Year: 1991, Page(s):182 - 189
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. Parallel disk I/O subsystems have been proposed as one way to close the gap between processor and disk speeds. In a previous paper the authors showed that prefetching and caching have the potential to deliver the performance benefits of parallel file systems to parallel applications. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interconnecting shared-everything systems for efficient parallel query processing

    Publication Year: 1991, Page(s):262 - 270
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The most debated architectures for parallel database processing are Shared Nothing (SN) and Shared Everything (SE) structures. Although SN is considered to be most scalable, it is very sensitive to the data skew problem. On the other hand, SE allows the collaborating processors to share the work load more efficiently. It, however, suffers from the limitation of the memory and disk I/O band-width. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel hierarchical evaluation of transitive closure queries

    Publication Year: 1991, Page(s):130 - 137
    Cited by:  Papers (32)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    Presents a new approach to parallel computation of transitive closure queries using a semantic data fragmentation. Tuples of a large base relation denote edges in a graph, which models a transportation network. A fragmentation algorithm is proposed which produces a partitioning of the base relation into several fragments such that any fragment corresponds to a subgraph. One fragment, called high-s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CAT: an execution model for concurrent full text search

    Publication Year: 1991, Page(s):151 - 158
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    An execution model based on concurrent frame signature file (CAT) is proposed for full text retrieval. The proposed method places emphasis on creating opportunities for concurrent access to the signature file, which resides on disks, without resorting to redundant storage. Thus, the advantage of low space overhead availed by signature file methods is retained, while the response time of retrieval ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive parallel hash join in main-memory databases

    Publication Year: 1991, Page(s):58 - 67
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    Presents an algorithm for parallel hash-join computation on main-memory databases that adapts to data skew, and its implementation on the IBM RP3 multiprocessor. The algorithm exploits the random access capabilities of main memory databases to detect and counteract skew on the fly. Data skew is detected at run time by monitoring the observed frequencies of values of the join attribute and applying... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance study of three high availability data replication strategies

    Publication Year: 1991, Page(s):18 - 28
    Cited by:  Papers (8)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1068 KB)

    The paper studies the relative performance of chained declustering, mirrored disks, and interleaved declustering, in a shared nothing database machine environment. In particular, it examines the relative performance of the three strategies when no failures have occurred, the effect of load imbalance caused by a disk or processor failure on system throughput and response time, and the tradeoff betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel sorting on a shared-nothing architecture using probabilistic splitting

    Publication Year: 1991, Page(s):280 - 291
    Cited by:  Papers (22)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    The authors consider the problem of external sorting in a shared-nothing multiprocessor. A critical step in the algorithms the authors consider is to determine the range of sort keys to be handled by each processor. They consider two techniques for determining these ranges of sort keys: exact splitting, using a parallel version of the algorithm proposed by Iyer, Ricard, and Varman; and probabilist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Marker-passing on a parallel knowledge processing testbed

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

    The authors have been experimenting with knowledge representation and reasoning mechanisms suitable for parallel computation. Their primary domain is natural language understanding (NLU) using a semantic network representation and parallel marker-passing techniques. They have implemented a multiprocessor called the Semantic Network Array Processor (SNAP-1) for real-time processing of moderately-si... View full abstract»

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