Processor Scheduling for Multiprocessor Joins


This paper presents a family of practical algorithms to schedule join execution in a shared memory multiprocessor environment. The algorithms are based upon page connectivity graphs and determine when t o read each data page into memory and how to schedule page joins on the available processors. Our goal is to overlap page reads with parallel join execution… (More)
DOI: 10.1109/ICDE.1989.47209

9 Figures and Tables


  • Presentations referencing similar topics