Multiprocessor Join Scheduling.

@article{DBLP:journals/tkde/MurphyR93,
  author    = {Marguerite C. Murphy and
               Doron Rotem},
  title     = {Multiprocessor Join Scheduling},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {5},
  number    = {2},
  year      = {1993},
  pages     = {322-338},
  ee        = {db/journals/tkde/MurphyR93.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1993 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Thomas L. Adam, K. Mani Chandy, J. R. Dickson: A Comparison of List Schedules for Parallel Processing Systems. Commun. ACM 17(12): 685-690(1974) BibTeX

[2]

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX

[3]

...

[4]

...

[5]

...

[6]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX

[7]

Pankaj Goyal, H. F. Li, E. Regener, Fereidoon Sadri: Scheduling of Page Fetches in Join Operations Using Bc-Trees. ICDE 1988: 304-310 BibTeX

[8]

Walter H. Kohler: A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems. IEEE Trans. Computers 24(12): 1235-1238(1975) BibTeX

[9]

...

[10]

Edward A. Lee, David G. Messerschmitt: Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing. IEEE Trans. Computers 36(1): 24-35(1987) BibTeX

[11]

T. H. Merrett, Yahiko Kambayashi, H. Yasuura: Scheduling of Page-Fetches in Join Operations. VLDB 1981: 488-498 BibTeX

[12]

Marguerite C. Murphy, Doron Rotem: Effective Resource Utilization for Multiprocessor Join Execution. VLDB 1989: 67-75 BibTeX

[13]

Marguerite C. Murphy, Doron Rotem: Processor Scheduling for Multiprocessor Joins. ICDE 1989: 140-148 BibTeX

[14]

Stephen K. Park, Keith W. Miller: Random Number Generators: Good Ones Are Hard to Find. Commun. ACM 31(10): 1192-1201(1988) BibTeX

[15]

...

[16]

...

[17]

...

[18]

...

[19]

Patrick Valduriez: Join Indices. ACM Trans. Database Syst. 12(2): 218-246(1987) BibTeX

Referenced by

1. Zhe Li, Kenneth A. Ross: Fast Joins Using Join Indices. VLDB J. 8(1): 1-24(1999)
2. John L. Pfaltz, Russell F. Haddleton, James C. French: Scalable, Parallel, Scientific Databases. SSDBM 1998: 4-11
3. Sunita Sarawagi, Michael Stonebraker: Reordering Query Execution in Tertiary Memory Databases. VLDB 1996: 156-167
4. Sunita Sarawagi: Query Processing in Tertiary Memory Databases. VLDB 1995: 585-596