Algorithms and Data Structures for External Memory

More documents

Recommendations

Info

References 159 [117] T. H. Cormen and E. R. Davidson, “FG: A framework generator for hiding latency in parallel programs running on clusters,” in Proceedings of the 17th International Conference on Parallel and Distributed Computing Systems, pp. 137–144, Sep. 2004. [118] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. Cambridge, Mass.: MIT Press, 2nd ed., September 2001. [119] T. H. Cormen and D. M. Nicol, “Performing out-of-core FFTs on parallel disk systems,” Parallel Computing, vol. 24, pp. 5–20, January 1998. [120] T. H. Cormen, T. Sundquist, and L. F. Wisniewski, “Asymptotically tight bounds for performing BMMC permutations on parallel disk systems,” SIAM Journal on Computing, vol. 28, no. 1, pp. 105–136, 1999. [121] A. Crauser and P. Ferragina, “A theoretical and experimental study on the construction of suffix arrays in external memory,” Algorithmica, vol. 32, no. 1, pp. 1–35, 2002. [122] A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, and E. A. Ramos, “I/Ooptimal computation of segment intersections,” in External Memory Algorithms and Visualization, (J. Abello and J. S. Vitter, eds.), pp. 131–138, Providence, Rhode Island: American Mathematical Society Press, 1999. [123] A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, and E. A. Ramos, “Randomized external-memory algorithms for line segment intersection and other geometric problems,” International Journal of Computational Geometry and Applications, vol. 11, no. 3, pp. 305–337, 2001. [124] A. Crauser and K. Mehlhorn, “LEDA-SM: Extending LEDA to secondary memory,” in Proceedings of the Workshop on Algorithm Engineering, (J. S. Vitter and C. Zaroliagis, eds.), pp. 228–242, London: Springer-Verlag, July 1999. [125] K. Curewitz, P. Krishnan, and J. S. Vitter, “Practical Prefetching Via Data Compression,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 257–266, Washington, DC: ACM Press, May 1993. [126] R. Cypher and G. Plaxton, “Deterministic sorting in nearly logarithmic time on the hypercube and related computers,” Journal of Computer and System Sciences, vol. 47, no. 3, pp. 501–548, 1993. [127] E. R. Davidson, FG: Improving Parallel Programs and Parallel Programming Since 2003. PhD thesis, Dartmouth College Department of Computer Science, Aug. 2006. [128] M. de Berg, J. Gudmundsson, M. Hammar, and M. H. Overmars, “On Rtrees with low query complexity,” Computational Geometry, vol. 24, no. 3, pp. 179–195, 2003. [129] M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry Algorithms and Applications. Berlin: Springer-Verlag, 1997. [130] J. Dean and S. Ghemawat, “MapReduce: Simplified data processing on large clusters,” in Proceedings of the Symposium on Operating Systems Design and Implementation, pp. 137–150, USENIX, December 2004. [131] F. K. H. A. Dehne, W. Dittrich, and D. A. Hutchinson, “Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms,” Algorithmica, vol. 36, no. 2, pp. 97–122, 2003.
160 References [132] F. K. H. A. Dehne, W. Dittrich, D. A. Hutchinson, and A. Maheshwari, “Bulk synchronous parallel algorithms for the external memory model,” Theory of Computing Systems, vol. 35, no. 6, pp. 567–597, 2002. [133] R. Dementiev, Algorithm Engineering for Large Data Sets. PhD thesis, Saarland University, 2006. [134] R. Dementiev, J. Kärkkäinen, J. Mehnert, and P. Sanders, “Better external memory suffix array construction,” ACM Journal of Experimental Algorithmics, in press. [135] R. Dementiev, L. Kettner, and P. Sanders, “STXXL: Standard Template Library for XXL Data Sets,” Software — Practice and Experience, vol. 38, no. 6, pp. 589–637, 2008. [136] R. Dementiev and P. Sanders, “Asynchronous parallel disk sorting,” in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pp. 138–148, ACM Press, 2003. [137] R. Dementiev, P. Sanders, D. Schultes, and J. Sibeyn, “Engineering an external memory minimum spanning tree algorithm,” in Proceedings of IFIP International Conference on Theoretical Computer Science, Toulouse: Kluwer Academic Publishers, 2004. [138] H. B. Demuth, Electronic data sorting. PhD thesis, Stanford University, 1956. [139] P. J. Denning, “Working sets past and present,” IEEE Transactions on Software Engineering, vol. SE-6, pp. 64–84, 1980. [140] D. J. DeWitt, J. F. Naughton, and D. A. Schneider, “Parallel sorting on a shared-nothing architecture using probabilistic splitting,” in Proceedings of the International Conference on Parallel and Distributed Information Systems, pp. 280–291, December 1991. [141] W. Dittrich, D. A. Hutchinson, and A. Maheshwari, “Blocking in parallel multisearch problems,” Theory of Computing Systems, vol. 34, no. 2, pp. 145– 189, 2001. [142] J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan, “Making data structures persistent,” Journal of Computer and System Sciences, vol. 38, pp. 86–124, 1989. [143] M. C. Easton, “Key-sequence data sets on indelible storage,” IBM Journal of Research and Development, vol. 30, pp. 230–241, 1986. [144] H. Edelsbrunner, “A new approach to rectangle intersections, Part I,” International Journal of Computer Mathematics, vol. 13, pp. 209–219, 1983. [145] H. Edelsbrunner, “A New approach to rectangle intersections, Part II,” International Journal of Computer Mathematics, vol. 13, pp. 221–229, 1983. [146] M. Y. Eltabakh, W.-K. Hon, R. Shah, W. Aref, and J. S. Vitter, “The SBCtree: An index for run-length compressed sequences,” in Proceedings of the International Conference on Extending Database Technology, Nantes, France: Springer-Verlag, March 2008. [147] R. J. Enbody and H. C. Du, “Dynamic hashing schemes,” ACM Computing Surveys, vol. 20, pp. 85–113, June 1988. [148] “NASA’s Earth Observing System (EOS) web page, NASA Goddard Space Flight Center,” http://eospso.gsfc.nasa.gov/.
Page 1 and 2:
TCSv2n4.qxd 4/24/2008 11:56 AM Page
Page 4 and 5:
Algorithms and Data Structures for
Page 6 and 7:
Foundations and Trends R○ in Theo
Page 8 and 9:
Foundations and Trends R○ in Theo
Page 10 and 11:
Preface I first became fascinated a
Page 12:
Preface xi I would like to thank my
Page 15 and 16:
xiv Contents 6 Lower Bounds on I/O
Page 18 and 19:
1 Introduction The world is drownin
Page 20 and 21:
However, not all memory references
Page 22 and 23:
1.1 Overview 5 Our general goal is
Page 24:
Table 1.1 Paradigms for I/O efficie
Page 27 and 28:
10 Parallel Disk Model (PDM) spindl
Page 29 and 30:
12 Parallel Disk Model (PDM) D = nu
Page 31 and 32:
14 Parallel Disk Model (PDM) The pr
Page 33 and 34:
16 Parallel Disk Model (PDM) 2.3 Re
Page 35 and 36:
18 Parallel Disk Model (PDM) archit
Page 38 and 39:
3 Fundamental I/O Operations and Bo
Page 40:
As Table 3.1 indicates, the multipl
Page 43 and 44:
26 Exploiting Locality and Load Bal
Page 45 and 46:
28 Exploiting Locality and Load Bal
Page 47 and 48:
30 External Sorting and Related Pro
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 74 and 75:
6 Lower Bounds on I/O In this chapt
Page 76 and 77:
6.1 Permuting 59 in backwards order
Page 78 and 79:
6.2 Lower Bounds for Sorting and Ot
Page 80:
6.2 Lower Bounds for Sorting and Ot
Page 83 and 84:
66 Matrix and Grid Computations the
Page 86 and 87:
8 Batched Problems in Computational
Page 88 and 89:
8.1 Distribution Sweep 71 Goodrich
Page 90 and 91:
8.1 Distribution Sweep 73 the curre
Page 92 and 93:
Time (seconds) Time (seconds) 7000
Page 94 and 95:
9 Batched Problems on Graphs The pr
Page 96 and 97:
Table 9.2 Best known I/O bounds for
Page 98 and 99:
9.2 Special Cases 81 that contains
Page 100 and 101:
10 External Hashing for Online Dict
Page 102 and 103:
2 000 000 001 010 011 100 101 110 1
Page 104 and 105:
10.2 Directoryless Methods 87 a tot
Page 106 and 107:
11 Multiway Tree Data Structures In
Page 108 and 109:
11.1 B-trees and Variants 91 “sha
Page 110 and 111:
11.3 Parent Pointers and Level-Bala
Page 112 and 113:
11.4 Buffer Trees 95 I/Os by follow
Page 114:
11.4 Buffer Trees 97 between update
Page 117 and 118:
100 Spatial Data Structures and Ran
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126: 108 Spatial Data Structures and Ran
Page 136 and 137: 13 Dynamic and Kinetic Data Structu
Page 138 and 139: 13.2 Continuously Moving Items 121
Page 140 and 141: 14 String Processing In this chapte
Page 142 and 143: 5 a b a 3 c a 0 b a 4 b 6 6 a b a b
Page 144 and 145: 14.3 Suffix Trees and Suffix Arrays
Page 146 and 147: 15 Compressed Data Structures The f
Page 148 and 149: 15.1 Data Representations and Compr
Page 150 and 151: 15.2 External Memory Compressed Dat
Page 152 and 153: 15.2 External Memory Compressed Dat
Page 154: 15.2 External Memory Compressed Dat
Page 157 and 158: 140 Dynamic Memory Allocation For s
Page 159 and 160: 142 External Memory Programming Env
Page 161 and 162: 144 External Memory Programming Env
Page 163 and 164: 146 Conclusions intriguing connecti
Page 165 and 166: 148 Notations and Acronyms lowercas
Page 167 and 168: 150 Notations and Acronyms � �
Page 169 and 170: 152 References Proceedings of the A
Page 171 and 172: 154 References [41] L. Arge, K. H.
Page 173 and 174: 156 References Computer Science, pp
Page 175: 158 References ACM Conference on In
Page 179 and 180: 162 References [165] R. W. Floyd,
Page 181 and 182: 164 References [195] M. R. Henzinge
Page 183 and 184: 166 References [228] K. Küspert,
Page 185 and 186: 168 References [261] D. R. Morrison
Page 187 and 188: 170 References [293] J. T. Robinson
Page 189 and 190: 172 References [325] “TerraServer
Page 191: 174 References [356] O. Wolfson, P.
show all

Algorithms and Data Structures for External Memory

Create successful ePaper yourself

Delete template?

Save as template?