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

Peng Liu, Yasushi Kiyoki, Takashi Masuda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationProceedings - International Conference on Distributed Computing Systems
Editors Anon
PublisherPubl by IEEE
Pages316-323
Number of pages8
Publication statusPublished - 1989 Jun
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

Fingerprint

Query processing
Resource allocation
Processing
Data storage equipment

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Liu, P., Kiyoki, Y., & Masuda, T. (1989). Efficient algorithms for resource allocation in distributed and parallel query processing environments. In Anon (Ed.), Proceedings - International Conference on Distributed Computing Systems (pp. 316-323). Publ by IEEE.

Efficient algorithms for resource allocation in distributed and parallel query processing environments. / Liu, Peng; Kiyoki, Yasushi; Masuda, Takashi.

Proceedings - International Conference on Distributed Computing Systems. ed. / Anon. Publ by IEEE, 1989. p. 316-323.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Liu, P, Kiyoki, Y & Masuda, T 1989, Efficient algorithms for resource allocation in distributed and parallel query processing environments. in Anon (ed.), Proceedings - International Conference on Distributed Computing Systems. Publ by IEEE, pp. 316-323, 9th International Conference on Distributed Computing Systems, Newport Beach, CA, USA, 89/6/5.
Liu P, Kiyoki Y, Masuda T. Efficient algorithms for resource allocation in distributed and parallel query processing environments. In Anon, editor, Proceedings - International Conference on Distributed Computing Systems. Publ by IEEE. 1989. p. 316-323
Liu, Peng ; Kiyoki, Yasushi ; Masuda, Takashi. / Efficient algorithms for resource allocation in distributed and parallel query processing environments. Proceedings - International Conference on Distributed Computing Systems. editor / Anon. Publ by IEEE, 1989. pp. 316-323
@inproceedings{3e30b38d05c74be6a0c05a24bd43a41a,
title = "Efficient algorithms for resource allocation in distributed and parallel query processing environments",
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.",
author = "Peng Liu and Yasushi Kiyoki and Takashi Masuda",
year = "1989",
month = "6",
language = "English",
pages = "316--323",
editor = "Anon",
booktitle = "Proceedings - International Conference on Distributed Computing Systems",
publisher = "Publ by IEEE",

}

TY - GEN

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

AU - Liu, Peng

AU - Kiyoki, Yasushi

AU - Masuda, Takashi

PY - 1989/6

Y1 - 1989/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024681038&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024681038&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024681038

SP - 316

EP - 323

BT - Proceedings - International Conference on Distributed Computing Systems

A2 - Anon, null

PB - Publ by IEEE

ER -