Workload balance and page access scheduling for parallel joins in shared-nothing systems

Chiang Lee, Zue An Chang

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

7 Citations (Scopus)

Abstract

This paper presents a methodology to resolve balancing and scheduling issues for parallel join execution in a shared-nothing multiprocessor environment. The past researches on parallel join methods mostly focused on the design of algorithms for partitioning (e.g., hashing) relations and distributing data buckets as evenly as possible to the processors. Once data are uniformly distributed to the processors, they assume that all processors will complete their tasks at about the same time. We stress that this is true if no further information such as page-level join index (to be discussed later) is available. Otherwise, the join execution can be further optimized and the workload in the processors may still be unbalanced. In this paper, we study such problems in a shared-nothing environment.

Original languageEnglish
Title of host publication1993 IEEE 9th International Conference on Data Engineering
PublisherPubl by IEEE
Pages411-418
Number of pages8
ISBN (Print)0818635703
Publication statusPublished - 1993
Event1993 IEEE 9th International Conference on Data Engineering - Vienna, Austria
Duration: 1993 Apr 191993 Apr 23

Other

Other1993 IEEE 9th International Conference on Data Engineering
CityVienna, Austria
Period93-04-1993-04-23

Fingerprint

Scheduling

All Science Journal Classification (ASJC) codes

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Lee, C., & Chang, Z. A. (1993). Workload balance and page access scheduling for parallel joins in shared-nothing systems. In 1993 IEEE 9th International Conference on Data Engineering (pp. 411-418). Publ by IEEE.
Lee, Chiang ; Chang, Zue An. / Workload balance and page access scheduling for parallel joins in shared-nothing systems. 1993 IEEE 9th International Conference on Data Engineering. Publ by IEEE, 1993. pp. 411-418
@inproceedings{24a3cf7f86c747d6a5db0b0bed1a98a1,
title = "Workload balance and page access scheduling for parallel joins in shared-nothing systems",
abstract = "This paper presents a methodology to resolve balancing and scheduling issues for parallel join execution in a shared-nothing multiprocessor environment. The past researches on parallel join methods mostly focused on the design of algorithms for partitioning (e.g., hashing) relations and distributing data buckets as evenly as possible to the processors. Once data are uniformly distributed to the processors, they assume that all processors will complete their tasks at about the same time. We stress that this is true if no further information such as page-level join index (to be discussed later) is available. Otherwise, the join execution can be further optimized and the workload in the processors may still be unbalanced. In this paper, we study such problems in a shared-nothing environment.",
author = "Chiang Lee and Chang, {Zue An}",
year = "1993",
language = "English",
isbn = "0818635703",
pages = "411--418",
booktitle = "1993 IEEE 9th International Conference on Data Engineering",
publisher = "Publ by IEEE",

}

Lee, C & Chang, ZA 1993, Workload balance and page access scheduling for parallel joins in shared-nothing systems. in 1993 IEEE 9th International Conference on Data Engineering. Publ by IEEE, pp. 411-418, 1993 IEEE 9th International Conference on Data Engineering, Vienna, Austria, 93-04-19.

Workload balance and page access scheduling for parallel joins in shared-nothing systems. / Lee, Chiang; Chang, Zue An.

1993 IEEE 9th International Conference on Data Engineering. Publ by IEEE, 1993. p. 411-418.

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

TY - GEN

T1 - Workload balance and page access scheduling for parallel joins in shared-nothing systems

AU - Lee, Chiang

AU - Chang, Zue An

PY - 1993

Y1 - 1993

N2 - This paper presents a methodology to resolve balancing and scheduling issues for parallel join execution in a shared-nothing multiprocessor environment. The past researches on parallel join methods mostly focused on the design of algorithms for partitioning (e.g., hashing) relations and distributing data buckets as evenly as possible to the processors. Once data are uniformly distributed to the processors, they assume that all processors will complete their tasks at about the same time. We stress that this is true if no further information such as page-level join index (to be discussed later) is available. Otherwise, the join execution can be further optimized and the workload in the processors may still be unbalanced. In this paper, we study such problems in a shared-nothing environment.

AB - This paper presents a methodology to resolve balancing and scheduling issues for parallel join execution in a shared-nothing multiprocessor environment. The past researches on parallel join methods mostly focused on the design of algorithms for partitioning (e.g., hashing) relations and distributing data buckets as evenly as possible to the processors. Once data are uniformly distributed to the processors, they assume that all processors will complete their tasks at about the same time. We stress that this is true if no further information such as page-level join index (to be discussed later) is available. Otherwise, the join execution can be further optimized and the workload in the processors may still be unbalanced. In this paper, we study such problems in a shared-nothing environment.

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

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

M3 - Conference contribution

AN - SCOPUS:0027294375

SN - 0818635703

SP - 411

EP - 418

BT - 1993 IEEE 9th International Conference on Data Engineering

PB - Publ by IEEE

ER -

Lee C, Chang ZA. Workload balance and page access scheduling for parallel joins in shared-nothing systems. In 1993 IEEE 9th International Conference on Data Engineering. Publ by IEEE. 1993. p. 411-418