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

Author

Liu, Peng ; Kiyoki, Yasushi ; Masuda, Takashi

Author_Institution

Inst. of Inf. Sci. & Electron., Tsukuba Univ., Japan

fYear

1989

fDate

5-9 Jun 1989

Firstpage

316

Lastpage

323

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

Keywords

computational complexity; database management systems; distributed processing; parallel processing; storage allocation; storage management; algorithms; computation complexities; database operations; distributed processing; memory resources; optimal allocation; parallel query processing environments; resource allocation; sequential-processing environments; shared-memory multiprocessors; stream-oriented parallel-processing scheme; Algorithm design and analysis; Computer networks; Concurrent computing; Distributed databases; Distributed processing; Information science; Microprocessors; Parallel processing; Query processing; Resource management;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1989., 9th International Conference on

Conference_Location

Newport Beach, CA

Print_ISBN

0-8186-1953-8

Type

conf

DOI

10.1109/ICDCS.1989.37961

Filename

37961