Efficient algorithms for resource allocation in distributed and parallel query processing environments

Peng Liu, Yasushi Kiyoki, Takashi Masuda

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

Several effective algorithms are presented for the optimal allocation of computer resources in a proposed stream-oriented parallel-processing scheme for database operations. These algorithms can be utilized to obtain the optimal allocation of memory resources for every type of query in sequential-processing environments, parallel-processing environments with shared-memory multiprocessors, and distributed-processing environments. The computation complexities of the proposed algorithms are analyzed and used to clarify the effectiveness of those algorithms.

Original languageEnglish
Pages316-323
Number of pages8
Publication statusPublished - 1989 Jun 1
Externally publishedYes
Event9th International Conference on Distributed Computing Systems - Newport Beach, CA, USA
Duration: 1989 Jun 51989 Jun 9

Other

Other9th International Conference on Distributed Computing Systems
CityNewport Beach, CA, USA
Period89/6/589/6/9

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Efficient algorithms for resource allocation in distributed and parallel query processing environments'. Together they form a unique fingerprint.

  • Cite this

    Liu, P., Kiyoki, Y., & Masuda, T. (1989). Efficient algorithms for resource allocation in distributed and parallel query processing environments. 316-323. Paper presented at 9th International Conference on Distributed Computing Systems, Newport Beach, CA, USA, .