Phil Garcia
- {1} A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood. DBMSs on a modern processor: Where does time go? In Proc. 25th International Conference on Very Large Data Bases, pages 266-277, 1999. Google Scholar
Digital Library
- {2} Anonymous et al. A measure of transaction processing power. Datamation, 31(7):112-118, 1985. Google ScholarDigital Library
- {3} P. Bohannon, P. McIlroy, and R. Rastogi. Main-memory index structures with fixed-size partial keys. In Proc. ACM SIGMOD International Conference on the Management of Data, 2001. Google ScholarDigital Library
- {4} S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry. Improving hash join performance through prefetching. In Proc. International Conference on Data Engineering, 2004. Google ScholarDigital Library
- {5} J. Dongarra, K. London, S. Moore, P. Mucci, and D. Terpstra. Using PAPI for hardware performance monitoring on Linux systems. In Conference on Linux Clusters: The HPC Revolution, June 2001.Google Scholar
- {6} S. J. Eggers, J. S. Emer, H. M. Levy, J. L. Lo, R. L. Stamm, and D. M. Tullsen. Simultaneous multithreading: A platform for next-generation processors. IEEE Micro, 17(5):12-18, September 1997. Google ScholarDigital Library
- {7} P. C. Garcia and H. F. Korth. Hash-join algorithms on modern multithreaded computer architectures. Technical Report LU-CSE-05-001, Lehigh Univ., 2005.Google Scholar
- {8} G. Graefe and P.-A. Larson. B-tree indexes and CPU caches. In Proc. IEEE International Conference on Data Engineering, pages 349-358, 2001. Google ScholarDigital Library
- {9} G. Hinton, D. Sager, M. Upton, D. Boggs, D. Carmean, A. Kyker, and P. Roussel. The microarchitecture of the Pentium 4 processor. Intel Technology Journal, (Q1), 2001.Google Scholar
- {10} Intel. Intel Pentium 4 Processor Optimization, 2001.Google Scholar
- {11} B. R. Iyer, G. R. Ricard, and P. J. Varman. Percentile finding algorithm for multiple sorted runs. In Proceedings of 15th International Conference on Very Large Data Bases, Amersterdam, 1989. Google ScholarDigital Library
- {12} H. Kwak, B. Lee, A. R. Hurson, S. Yoon, and W. Hahn. Effects of multithreading on cache performance. IEEE Transactions on Computers, 48(2):176-184, February 1999. Google ScholarDigital Library
- {13} S. Manegold, P. A. Boncz, and M. L. Kersten. Optimizing main-memory join on modern hardware. IEEE Transactions on Knowledge and Data Engineering, 14(4):709-730, 2002. Google ScholarDigital Library
- {14} D. T. Marr, F. Binns, D. L. Hill, G. Hinton, D. A. Koufaty, J. A. Miller, and M. Upton. Hyper-threading technology architecture and microarchitecture. Intel Technology Journal, (Q1):4-15, 2002.Google Scholar
- {15} C. Nyberg, T. Barclay, Z. Cvetanovic, J. Gray, and D. Lomet. Alphasort: A RISC machine sort. In SIGMOD, pages 233-242. ACM, May 1994. Google ScholarDigital Library
- {16} C. Nyberg, J. Gray, and C. Koester. A minute with Nsort on a 32P NEC Windows Itanium2 server. Technical report, Microsoft Research, April 2004.Google Scholar
- {17} J. Rao and K. A. Ross. Making B+-trees cache conscious in main memory. In Proc. ACM SIGMOD International Conference on the Management of Data, pages 475-486, 2000. Google ScholarDigital Library
- {18} A. Shatdal, C. Kant, and J. Naughton. Cache conscious algorithms for relational query processing. In Proceedings of 20th International Conference on Very Lage Data Bases, pages 510-524, 1994. Google ScholarDigital Library
- {19} N. Tuck and D. M. Tullsen. Initial observations of the simultaneous multithreading Pentium 4 processor. In Proc. 12th International Conference on Parallel Architectures and Compilation Techniques, 2003. Google ScholarDigital Library
- {20} D. M. Tullsen, S. Eggers, J. S. Emer, H. M. Levy, J. L. Lo, and R. L. Stamm. Exploiting choice: Instruction fetch and issue on an implementable simultaneous multithreading processor. In Proc. ACM IEEE International Symposium on Computer Architecture, pages 191-202, 1996. Google ScholarDigital Library
- {21} H. Wang, P. H. Wang, R. D. Weldon, S. M. Ettinger, H. Saito, M. Girkar, S. S. Liao, and J. P. Shen. Speculative precomputation: Exploring the use of multithreading for latency. Intel Technology Journal, (Q1):22-35, 2002.Google Scholar
- Multithreaded architectures and the sort benchmark
Recommendations
K-Way Bitonic Sort
The k-way bitonic sort algorithm, a generalization of K.E. Batcher's bitonic sort algorithm (1968), is presented. This variation of the algorithm is based on a k-way decomposition instead of a two-way decomposition. It is proven that Batcher's bitonic ...
Subsetting the SPEC CPU2006 benchmark suite
On August 24, 2006, the Standard Performance Evaluation Corporation (SPEC) announced CPU2006 -- the next generation of industry-standardized CPU-intensive benchmark suite. The SPEC CPU benchmark suite has become the most frequently used suite for ...
A Benchmark Characterization of the EEMBC Benchmark Suite
Benchmark consumers expect benchmark suites to be complete, accurate, and consistent, and benchmark scores serve as relative measures of performance. However, it is important to understand how benchmarks stress the processors that they aim to test. This ...
Comments