Effective resource utilization for multiprocessor join execution

Conference · Sun Jan 01 04:00:00 EST 1989

OSTI ID:5754837

Murphy, M C; Rotem, D

Conventional approaches to execution of database queries on general purpose multiprocessors attempt to maximize system throughput using inter-query parallelism with a fixed number of processors. Standard uniprocessor optimization techniques are used to minimize execution time of individual queries. Our approach is to increase performance by utilizing intra-query parallelism as well as minimizing overall resource requirements. Specifically, processor and i/o bandwidth requirements are minimized by coordinating the order in which data pages are read into memory and page joins assigned to available processors. We present a scheduling strategy based on join indices and prove lower and upper bounds on its resource requirements. We then describe a heuristic for estimating the number of processors required to complete join execution in minimal time. Our simulation results indicate that these techniques are effective with respect to processor utilization and buffer requirements. 11 refs.

• Research Organization: Lawrence Berkeley Lab., CA (USA)
• DOE Contract Number: AC03-76SF00098
• OSTI ID: 5754837
• Report Number(s): LBL-26601; CONF-8908116-1; ON: DE89016303
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
DATA BASE MANAGEMENT
MANAGEMENT
OPTIMIZATION
PERFORMANCE