Benchmarking the Efficiency of Array Processing for Various Types of Language Processors
In this paper, we propose a benchmarking technique and performance indicators that can be used to evaluate and compare programming languages and language processors in the area of efficiency of array processing. The proposed subscript permutation technique is applied to matrix multiplication benchmarking and used to differentiate language processors and provide insight into performance levels attainable by scripting languages, virtual machine based languages, and languages that compile to the native machine language. Our experimental analysis covers 10 popular languages and 14 language processors. We also investigate general effects that the optimization of array processing has in software engineering and benchmarking.
Jozo J. Dujmović was born in Dubrovnik, Croatia, and received the Dipl. Ing. degree in electronic and telecommunication engineering in 1964, and the M.Sc. and Sc.D. degrees in computer engineering, in 1973 and 1976 respectively, all from the University of Belgrade, Serbia.
Since 1994 he has been Professor of Computer Science at San Francisco State University, where he served as Chair of Computer Science Department from 1998 to 2002. His teaching and research activities are in the areas of soft computing, software metrics and computer performance evaluation. In 1973 he introduced the concepts of andness and orness and logic aggregators based on continuous transition from conjunction to disjunction. He is the author of approximately 130 refereed publications, including 13 books and book chapters. Before his current position at San Francisco State University, he was Professor of Computer Science at the University of Belgrade, University of Florida (Gainesville), University of Texas (Dallas), and Worcester Polytechnic Institute. In addition, he was teaching in the graduate Computer Science programs at the National Universities of San Luis and Jujuy (both in Argentina). At the University of Belgrade, where he was teaching from 1968 to 1992, he also served as Chairman of Computer Science Department, and as founding Director of the Belgrade University Computing Center. His industrial experience includes work in the Institute "M. Pupin" in Belgrade, and consulting in the areas of decision methods, performance evaluation, and software design.
Nathan Luis was born in San Francisco, California. He earned a B.S. in Computer Science with a Minor in Mathematics at San Francisco State University in 2002. In 2008, he earned an M.A. in Economics. He is currently working toward an M.S. in Computer Science at SFSU.
Nathan's work experience is primarily in Web and Database development in the nonprofit field.