[1]FRIGO,LEISERSON,RAMACHANDRAN P.Cache-oblivious algorithms[C].In Proc.40th Annual Symposium on Foundations of Computer Science(EOCS),1999:285-297.
[2]PATTERSON,HENNESSY.Computer organization and design the hardware/software interface[M].USA MA:Morgan Kanfmann,1997.
[3]HENNESSY,PATTERSON.Computer architecture:a quantitative approach[M].USA MA:Morgan Kaufmann Publishers Inc,2003.
[4]HILL L.Cache performance[D].USA Ulta:University of Wisconsin—Madison,2002.
[5]ERICSON,CHRISTEr.Memory optimization[C].CDC2003,Santa Monica:Sony Computer Entertainment,2003.
[6]DING C.Data layout optimizations,computer organization[M].NY:Lecture,Rochester,2004.
[7]VAN EMDE P BOAS.Preserving order in a forest in less than logarithmic time and linear space[C].Information Process Letter,1977(6):80-82.
[8]SZECSI.An effective implementation of the K-D yree[M].USA:In Graphics Programming Methods,Charles River Media,2003.
[9]WLOKA MATTHIAS.Batch,batch,batch:what does it really mean?[C].Presentation at Game Developers Conference,2003.
[10]SEDGEWICK.Algorithm s in C[M].USA:Addison Wesley,1990.
[11]BRODAL.Cache oblivious searching and sorting[M].Copenhagen,Denmark:Seminar,ITUniversity of Copenhagen,2003.
[12]GOMEZ,LOURA.Compressed axis-aligned bounding box trees[M].Copenhagen,Denmark:Charles River Media,2001. |