Aart Bik's Publications (most recent first)

Conferences 2023

• Aart J.C. Bik and Peiming Liu. Moving the MLIR Sparse Compiler Pipeline into Production. Second Workshop on Compiler Techniques for Sparse Tensor Algebra (CTSTA), Orlando, Florida, June 18, 2023 (during PLDI 2023).
• Joo Hyung Lee, Wonpyo Park, Nicole Mitchell, Jonathan Pilault, Johan Obando-Ceron, Han-Byul Kim, Namhoon Lee, Elias Frantar, Yun Long, Amir Yazdanbakhsh, Shivani Agrawal, Suvinay Subramanian, Xin Wang, Sheng-Chun Kao, Xingyao Zhang, Trevor Gale, Aart J.C. Bik. Woohyun Han, Milen Ferev, Zhonglin Han, Hong-Seok Kim, Yann Dauphin, Gintare Karolina Dziugaite, Pablo Samuel Castro, and Utku Evci. JaxPruner: A Concise Library for Sparsity Research. Sparsity in Neural Networks Worshop. Kigali, Rwanda, May 5, 2023.
• Aart J.C. Bik. Sparse Compilation (recording and slides). OpenXLA Dev Summit, April 27, 2023.

Journal Papers 2022

• Aart J.C. Bik, Penporn Koanantakool, Tatiana Shpeisman, Nicolas Vasilache, Bixia Zheng, and Fredrik Kjolstad. Compiler Support for Sparse Tensor Computations in MLIR. ACM Transactions on Architecture and Code Optimization, June, 2022 (appeared as as pre-print arXiv:2202.04305, February 7, 2022).

Conferences 2022

• Nicolas Vasilache, Oleksandr Zinenko, Aart J.C. Bik, Mahesh Ravishankar, Thomas Raoux, Alexander Belyaev, Matthias Springer, Tobias Gysi, Diego Caballero, Stephan Herhut, Stella Laurenzo, and Albert Cohen. Structured Operations: Modular Design of Code Generators for Tensor Compilers. In: Mendis, C., Rauchwerger, L. (eds) Languages and Compilers for Parallel Computing. Lecture Notes in Computer Science, vol 13829. LCPC, May 2022.
• Aart J.C. Bik. Sparse Compiler Progress. 2022 LLVM Developers' Meeting (MLIR Summit "Project Updates" Track), November 7-10, 2022.

• Nicolas Vasilache, Oleksandr Zinenko, Aart J.C. Bik, Mahesh Ravishankar, Thomas Raoux, Alexander Belyaev, Matthias Springer, Tobias Gysi, Diego Caballero, Stephan Herhut, Stella Laurenzo, and Albert Cohen. Composable and Modular Code Generation in MLIR: A Structured and Retargetable Approach to Tensor Compiler Construction. Distributed as pre-print arXiv:2202.03293, February 7, 2022.

Conferences 2021

• Aart J.C. Bik. Compiler Support for Sparse Tensor Computations in MLIR. 2021 LLVM Developers' Meeting, November 16-19, 2021.

• Aart J.C. Bik. A Note on Exhaustive State Space Search for Efficient Code Generation. Distributed as pre-print arXiv:2107.00564, June 24, 2021.

Presentations 2021

• Aart J.C. Bik. Intel AMX Dialect in MLIR. Presented at the MLIR Open Design Meeting, March 18, 2021 (slides and recording).
• Aart J.C. Bik. Sparse Tensor Types in MLIR (discussion). Presented at the MLIR Open Design Meeting, March 11, 2021 (recording).
• Aart J.C. Bik. Compiler Support for Sparse Tensor Computations in MLIR. Presented at the MLIR Open Design Meeting, February 18, 2021 (slides and recording).

Patents 2021

• Label Propagation in a Distributed System. M.H. Austern, J.C. Dehnert, A.J.C. Bik, G. Czajkowski, and G. Malewicz. US Patent 16/707,033, GP-5406-04-US-CON-03, 2021.

Presentations 2020

• Aart J.C. Bik. MLIR Case-Study: AVX512 Codegen for Vector Dialect. Presented at the MLIR Open Design Meeting, May 21, 2020 (slides and recording).

Awards 2020

• The paper "Pregel: A System for Large-Scale Graph Processing" (authors Grzegorz Malewicz, Matthew H. Austern, Aart J.C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski) won the 2020 ACM SIGMOD Test of Time Award for its impact over the last decade.

Patents 2019

• Data Backup in a Graph Processing System. A.J.C. Bik, J.C. Dehnert, M.H. Austern, and G. Czajkowski. US Patent 10,268,777, April 23, 2019.

Patents 2018

• Multiple Reference Point Shortest Path Algorithm. M.E.M.A.E.A. Khalefa, M.H. Austern, J.C. Dehnert, A.J.C. Bik, G. Czajkowski, and G. Malewicz. US Patent 9,870,631, January 16, 2018.

Conferences 2017

• A.J.C. Bik and A. Serov. Automatic Vectorization in ART (Android RunTime). Linaro Connect, San Francisco, California, Sept 25-29, 2017.
• A.J.C. Bik, M. Chartier, D. Sehr, and N. Geoffray. Performance and Memory Improvements in Android RunTime (ART). Google I/O 2017, Shoreline Amphitheatre Mountain View, California, May 17-19, 2017.

Patents 2017

• Distributing Global Values in a Graph Processing System. M.H. Austern, J.C. Dehnert, A.J.C. Bik, and G. Czajkowski. US Patent 9,819,73, November 14, 2017.
• Confined Recovery in a Distributed Computing System. G. Malewicz, M.H. Austern, J.C. Dehnert, A.J.C. Bik, and G. Czajkowski. US Patent 9,727,425, August 8, 2017.
• Label Propagation in a Distributed System. M.H. Austern, J.C. Dehnert, A.J.C. Bik, G. Czajkowski, and G. Malewicz. US Patent 9,652,876, May 16, 2017.

Patents 2016

• Data Storage in a Graph Processing System. J.C. Dehnert, M.H. Austern, A.J.C. Bik, G. Czajkowski, G. Malewicz, I. Horn, N. Leiser. US Patent 9,495,477, November 15, 2016.
• Distributing Global Values in a Graph Processing System. M.H. Austern, J.C. Dehnert, A.J.C. Bik, G. Czajkowski, and G. Malewicz. US Patent 9,385,845, July 5, 2016.

Patents 2015

• Multiple Reference Point Shortest Path Algorithm. M.E.M.A.E.A. Khalefa, M.H. Austern, J.C. Dehnert, A.J.C. Bik, G. Czajkowski, and G. Malewicz. US Patent 9,135,565, September 15, 2015.
• Data Backup in a Graph Processing System. A.J.C. Bik, J.C. Dehnert, M.H. Austern, and G. Czajkowski. US Patent 9,104,665, August 11, 2015.
• Confined Recovery in a Distributed Computing System. G. Malewicz, M.H. Austern, J.C. Dehnert, A.J.C. Bik, and G. Czajkowski. US Patent 9,026,850, May 5, 2015.

Patents 2014

• Optimum Checkpoint Frequency. C. Reiss, G. Malewicz, M.H. Austern, J.C. Dehnert, A.J.C. Bik, and G. Czajkowski. US Patent 8,880,941, November 14, 2014.
• Label Propagation in a Distributed System. M.H. Austern, J.C. Dehnert, A.J.C. Bik, G. Czajkowski, and G. Malewicz. US Patent 8,793,283, July 29, 2014.
• Resolving Conflicting Graph Mutations. A.J.C. Bik M.H. Austern, J.C. Dehnert, G. Czajkowski, G. Malewicz, and N. Leiser. US Patent 8,645,429, February 4, 2014.

Journal Papers 2012

• A.J.C. Bik. Computing Deep Perft and Divide Numbers for Checkers. International Computer Games Association Journal, December, 2012 (see http://www.icga.org/).
• A.J.C. Bik. Chess for Android. Computer Schaak. Uitgave CSVN (Computer Schaak Vereniging Nederland), September, 2012 (see http://www.csvn.nl/).

Miscellaneous 2012

• Joined the Editorial Board of the International Journal of Parallel Programming (Springer).
• Member of the Program Committee for the Multicore and GPU Programming Models, Languages and Compilers Workshop. Shanghai, China, May 21st, 2012 (Co-located with IPDPS 2012).

Journal Papers 2011

• A.J.C. Bik. How Data Dependence Affects Performance. Dr. Dobbs Journal, November, 2011 (see http://www.ddj.com/). Material taken from Software Vectorization Handbook.

Miscellaneous 2011

• Joined the Graph500 steering committee, September 2011.

Conference Papers 2010

• Grzegorz Malewicz, Matthew H. Austern, A.J.C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. Pregel: A System for Large-scale Graph Processing. In proceedings of the ACM SIGMOD/PODS Conference, Indianapolis, Indiana, June 6-11, 2010 (see http://www.sigmod2010.org/research_list.shtml/).

Conference Papers 2009

• Grzegorz Malewicz, Matthew H. Austern, A.J.C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. Pregel: A System for Large-scale Graph Processing. In proceedings of the 28th ACM symposium on principles of distributed computing, page 6, Calgary, Alberta, Canada, August 10-12, 2009.

Journal Papers 2008

• A.J.C. Bik, D. Kreitzer, and X. Tian. A Case Study on Compiler Optimizations for the Intel Core 2 Duo Processor. International Journal of Parallel Programming, 2008 (see http://dx.doi.org/10.1007/s10766-008-0071-8).

Miscellaneous 2008

• Member of the Program Committee for the Workshop on Software and Hardware Challenges of Manycore Platforms. Beijing, China, June 22, 2008 (Co-located with ISCA08).

Books 2006

• R. Gerber, A.J.C. Bik, K.B. Smith, X. Tian. The Software Optimization Cookbook (second edition). High-Performance Recipes for the Intel Architecture. ISBN 0-9764832-1-1, Intel Press, March, 2006.

Journal Papers 2006

• A.J.C. Bik, X. Tian, and M. Girkar. Multimedia Vectorization of Floating-Point MIN/MAX Reductions. Concurrency and Computation: Practice and Experience, Volume 18, Issue 9, pages 997-1007, 12 January, 2006 (see http://onlinelibrary.wiley.com/).

Conference Papers 2006

• X. Tian and A.J.C. Bik. A New High-Level and Parallel Optimizer to Unleash Multi-Core Power. Intel Software Enabling Summit, Anaheim, California, September 11-14, 2006.

Patents 2006

• Apparatus and Method for Vectorization of Detected Saturation and Clipping Operations in Serial Code Loops of a Source Program. A.J.C. Bik and M. Girkar. US Patent 7,020,873 B2, March 28, 2006.

Journal Papers 2005

• X. Tian, M. Girkar, A.J.C. Bik, and H. Saito. Practical Compiler Techniques on Efficient Multithreaded Code Generation for OpenMP Programs. The Computer Journal, Volume 48, Issue 5, pages 558-601, 2005.

Books 2004

• A.J.C. Bik. The Software Vectorization Handbook. Applying Multimedia Extensions for Maximum Performance. ISBN 0-9743649-2-4, Intel Press, June, 2004.

Journal Papers 2004

• K.B. Smith, A.J.C. Bik, and X. Tian. Support for the Intel Pentium 4 Processor with Hyper-Threading Technology in Intel 8.0 Compilers. Intel Technology Journal, Volume 8, Issue 1, February, 2004 (see http://intel.com/technology/itj/).

Patents 2004

• Apparatus and Method for Implementing Adjacent, Non-unit Stride Memory Access Patterns Utilizing SIMD instructions. A.J.C. Bik and M. Girkar. US Patent 20,040,006,667, January 8, 2004.
• Apparatus and Method for Vectorization of Detected Saturation and Clipping Operations in Serial Code Loops of a Source Program. A.J.C. Bik and M. Girkar. US Patent 20,040,001,066, January 1, 2004.

Miscellaneous 2004

• Member of the Program Committee for the 12th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS). Volendam, The Netherlands. October 5-7, 2004.

Journal Papers 2003

• A.J.C. Bik. Vectorization with the Intel Compilers. Intel Developer Services, 2003 (see http://software.intel.com/en-us/articles/vectorization-with-the-intel-compilers-part-i/).
• X. Tian. M. Girkar, Y-K. Chen, A.J.C. Bik, and E. Su. Exploring the Use of HyperThreading Technology for Multimedia Applications. OS News, March, 2003 (see http://www.osnews.com/).
• A.J.C. Bik, M. Girkar, P.M. Grey, and X. Tian. Programming Guidelines for C/C++ Vectorizing Compilers. C/C++ Users Journal, February, 2003.
• D.A. Schouten, X. Tian, A.J.C. Bik, and M. Girkar. Inside the Intel Compiler. Linux Journal, February, 2003 (see http://www.linuxjournal.com/).
• X. Tian, A.J.C. Bik, M. Girkar, and P.M. Grey. Exploiting Thread-Level and Instruction-Level Paralellism for Hyper-Threading Technology. Intel Developer Update Magazine, January, 2003 (see http://www.intel.com/technology/magazine/).

Journal Papers 2002

• A.J.C. Bik, M. Girkar, P.M. Grey, and X. Tian. Automatic Intra-Register Vectorization for the Intel Architecture. International Journal of Parallel Programming, Volume 30, pages 65-98, April 2002.
• X. Tian, A.J.C. Bik, M. Girkar, P.M. Grey, H. Saito, and E. Su. Intel OpenMP C++/Fortran Compiler for Hyper-Threading Technology: Implementation and Performance. Intel Technology Journal, Volume 6, Issue 1, February, 2002 (see http://software.intel.com/en-us/articles/intel-openmp-cfortran-compiler-for-hyper-threading-technology//).

Conference Papers 2002

• A.J.C. Bik, M. Girkar, P.M. Grey, and X. Tian. Automatic Detection of Saturation and Clipping Idioms. In Proceedings of the 15th International Workshop on Languages and Compilers for Parallel Computers, July, 2002. [Printed in: Lecture Notes in Computer Science, No. 2481, pages 61-74, Springer-Verlag, 2005]

Journal Papers 2001

• A.J.C. Bik, M. Girkar, P.M. Grey, and X. Tian. Efficient Exploitation of Parallelism on Pentium III and Pentium 4 Processor-Based Systems. Intel Technology Journal, February, 2001 (see http://intel.com/technology/itj/).
• A.J.C. Bik, M. Girkar, P.M. Grey, and X. Tian. Automatically Exploiting Implicit Parallelism. Dr. Dobbs Journal, July, 2001 (see http://www.ddj.com/).

Conference Papers 2001

• A.J.C. Bik, M. Girkar, P.M. Grey, and X. Tian. Experiments with Automatic Vectorization for the Pentium 4 Processor. The 9th Workshop on Compilers for Parallel Computers, Edinburgh, Scotland, UK, June 27-29, 2001 (download at http://www.icsa.informatics.ed.ac.uk/cpc2001/Speakers/bik.html).

Miscellaneous 2000

• Member of the Program Committee for the ACM Java Grande Conference, San Francisco, California, June 3-4, 2000.

Journal Papers 1999

• A.J.C. Bik and H.A.G. Wijshoff. Automatic Nonzero Structure Analysis. SIAM Journal on Computing, Volume 28, No. 5, pages 1576-1587, 1999.
• A.J.C. Bik, M. Girkar, and M.R. Haghighat. Incorporating Intel MMX Technology into a Java JIT Compiler. Scientific Programming, Volume 7, No. 2, pages 167-184, 1999.

Conference Papers 1999

• A.J.C. Bik, M. Girkar, and M.R. Haghighat. Experiences with Java JIT Optimization. International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems, Maui, Hawaii, Oct 26-28, 1998. [Printed in: IEEE Computer Society, pages 87-94, 1999]

Miscellaneous 1999

• A.J.C. Bik, M. Girkar, and M.R. Haghighat. Tutorial: JIT Compilation of Java for Intel Architecture.
  Presented at
  • ACM Java Grande Conference, San Francisco, California, June 12-14, 1999.
  • ACM International Conference on Supercomputing, Rhodes, Greece, June 20-25, 1999.

Journal Papers 1998

• A.J.C. Bik, F. Breg, and D.B. Gannon. Compiler Support for Java Parallelization. Computers in Physics, pages 45-52, Volume 12, No. 1, 1998.
• A.J.C. Bik, P.J.H Brinkhaus, P.M.W. Knijnenburg, and H.A.G. Wijshoff. The Automatic Generation of Sparse Primitives. ACM Transactions on Mathematical Software, Volume 24, pages 190-225, 1998.
• A.J.C. Bik and D.B. Gannon. A Prototype Bytecode Parallelization Tool. Concurrency, Practice and Experience, Volume 10(11), pages 879-885, 1998. [Also presented as poster at the ACM Workshop on Java for High-Performance Network Computing, Palo Alto, California, 1998]

Conference Papers 1998

• A.J.C. Bik, J.E. Villacis, and D.B. Gannon. Experiences with Loop Parallelization in JAVAR. In Proceedings of the 10th International Workshop on Languages and Compilers for Parallel Computers, 1997. [Printed in: Lecture Notes in Computer Science, No. 1366, pages 355-366, Springer-Verlag, 1998]

Journal Papers 1997

• A.J.C. Bik and D.B. Gannon. Exploiting Implicit Parallelism in Java. Concurrency, Practice and Experience, Volume 9(6): pages 579-619, 1997.
• A.J.C. Bik and H.A.G. Wijshoff. Iteration Space Partitioning. Future Generation Computer Systems, Volume 12: pages 421-429, 1997.
• A.J.C. Bik and D.B. Gannon. A Note on Native Level 1 BLAS in Java. Concurrency, Practice and Experience, Volume 9(11), pages 1091-1099, 1997. [Also presented as poster at the ACM Workshop on Java for Science and Engineering Computation, Las Vegas, Nevada, 1997]
• A.J.C. Bik, J.E. Villacis, and D.B. Gannon. JAVAR: A Prototype Java Restructuring Compiler. Concurrency, Practice and Experience, Volume 9(11), pages 1181-1191, 1997. [Also presented as poster at the ACM Workshop on Java for Science and Engineering Computation, Las Vegas, Nevada, 1997]

Conference Papers 1997

• A.J.C. Bik and H.A.G. Wijshoff. Simple Qualitative Experiments with a Sparse Compiler. In Proceedings of the 9th International Workshop on Languages and Compilers for Parallel Computing, 1996. [Printed in: Lecture Notes in Computer Science, No. 1239, pages 466-480, Springer-Verlag, 1997]

PhD Thesis 1996

• A.J.C. Bik. Compiler Support for Sparse Matrix Computations. ISBN 90-9009442-3, NUGI 855, Leiden University, 1996. This PhD thesis received the C.J. Kok Award (outstanding thesis award) from the Leiden University.

Journal Papers 1996

• A.J.C. Bik and H.A.G. Wijshoff. Automatic Data Structure Selection and Transformation for Sparse Matrix Computation. IEEE Transactions on Parallel and Distributed Systems, Volume 7, pages 109-126, 1996.
• A.J.C. Bik and H.A.G. Wijshoff. The Use of Iteration Space Partitioning to Construct Representative Simple Sections. Journal of Parallel and Distributed Computing, Volume 34, pages 95-110, 1996.

Conference Papers 1996

• A.J.C. Bik and H.A.G. Wijshoff. Annotations for a Sparse Compiler. In Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing, 1995. [Printed in: Lecture Notes in Computer Science, No. 1033, pages 500-514, Springer-Verlag, 1996]
• A.J.C. Bik and H.A.G. Wijshoff. Iteration Space Partitioning. In Proceedings of High-Performance Computing and Networking, 1996. [Printed in: Lecture Notes in Computer Science, No. 1067, pages 475-484, Springer-Verlag, 1996]
• A.J.C. Bik and H.A.G. Wijshoff. MT1: A Prototype Restructuring Compiler. In Proceedings of the second annual Conference of the ASCI, Lommel, Belgium, pages 78-83, 1996.
• A.J.C. Bik and H.A.G. Wijshoff. A Note on Dealing with Subroutines and Functions in the Automatic Generation of Sparse Codes. In Proceedings of the second annual Conference of the ASCI, Lommel, Belgium, pages 96-101, 1996.
• A.J.C. Bik and H.A.G. Wijshoff. Simple Quantitative Experiments with a Sparse Compiler. In Proceedings of Irregular 1996. [Printed in: Lecture Notes in Computer Science, No. 1117, pages 249-262, Springer-Verlag, 1996]
• A.J.C. Bik and P.M.W. Knijnenburg. Reshaping Access Patterns for Improving Data Locality. In Proceedings of the 6th Workshop on Compilers for Parallel Computers, pages 229-310, 1996.

Journal Papers 1995

• A.J.C. Bik and H.A.G. Wijshoff. Advanced Compiler Optimizations for Sparse Computations. Journal of Parallel and Distributed Computing, Volume 31, pages 14-24, 1995.

Conference Papers 1995

• A.J.C. Bik, P.M.W. Knijnenburg, and H.A.G. Wijshoff. Reshaping Access Patterns for Generating Sparse Codes. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, 1994. [Printed in: Lecture Notes in Computer Science, No. 892, pages 406-422, Springer-Verlag, 1995]
• A.J.C. Bik and H.A.G. Wijshoff. Implementation of Fourier-Motzkin Elimination. In Proceedings of the first annual Conference of the ASCI, The Netherlands, pages 377-386, 1995.
• P.M.W. Knijnenburg and A.J.C. Bik. On Reducing Overhead in Loops. Proceedings of the 5th International Workshop on Compilers for Parallel Computers, pages 200-211, 1995.
• A.J.C. Bik and H.A.G. Wijshoff. Construction of Representative Simple Sections. In Proceedings of the International Conference on Parallel Processing, pages II:9-18, 1995.

Conference Papers 1994

• A.J.C. Bik and H.A.G. Wijshoff. On Automatic Data Structure Selection and Code Generation for Sparse Computations. In Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, 1993. [Printed in: Lecture Notes in Computer Science, No. 768, pages 57-75, Springer-Verlag, 1994]
• A.J.C. Bik and H.A.G. Wijshoff. Nonzero Structure Analysis. In Proceedings of the International Conference on Supercomputing, pages 226-235, 1994.

Conference Papers 1993

• A.J.C. Bik and H.A.G. Wijshoff. Compilation Techniques for Sparse Matrix Computations. In Proceedings of the International Conference on Supercomputing, pages 416-424, 1993.
• A.J.C. Bik and H.A.G. Wijshoff. Advanced Compiler Optimizations for Sparse Computations. In Proceedings of Supercomputing, pages 430-439, 1993.

MSc Thesis 1992

• A.J.C. Bik. A Prototype Restructuring Compiler, MSc Thesis, no. INF/SCR-92-11, Utrecht University, 1992.

Student Project 1991

• A.J.C. Bik. Program Restructuring, Technical Report, no. INF/VER-91-19, Utrecht University, 1991.