John P. Bonomo

Pipelined iterative methods for shared memory machines

Abstract In this paper we describe a new parallel iterative technique to solve a set of linear equations. The technique can be applied to any serial iterative scheme and involves pipelining successive iterations. We give an example of this technique by modifying the classical successive overrelaxation method (SOR). The algorithm is implemented on a Sequent Symmetry multiprocessor machine and the experimental results are presented.

How Do You Stack Up

John P. Bonomo (bonomojp@westminster.edu) is an associate professor of computer science at Westminster College. He has both a B.S. and an M.S. in physics from Catholic University and a Ph.D. in computer science from Purdue University. He has served as a judge and a problem contributor for the International Collegiate Programming Contest several times, most recently in March, 2004. His interests outside academia focus on his wife and their three children (who served as inspiration for this article). He also fancies himself an excellent bridge player, but he is mistaken.

The Solution to a Hanoi-ing Little Problem

John Bonomo (bonomojp@westminster.edu, MR ID 745245) is a professor of computer science at Westminster College. He has a B.S. and M.S. in physics from Catholic University and a Ph.D. in computer science from Purdue University. Since 2012, Bonomo has served as Head Judge for the World Finals of the International Collegiate Programming Contest. His interests outside of academia focus primarily on his wife, his three children, bridge, and rooting for Manchester City.

Winning a Pool Is Harder Than You Thought

Summary This article address the question of whether or not it is possible to know if you are mathematically eliminated from a type of betting pool known as a confidence pool. We show that this problem falls in the category of NP-complete problems, meaning that there is almost surely no quick method to determine the answer.

Not All Numbers Can Be Created Equally

Summary We take a well-known problem—which numbers can or cannot be written as a sum of consecutive integers—and generalize it for summations involving any arithmetic sequence. Various general and specific theorems involving these summations are proven.