A team of students from the University of Utah’s School of Computing won a competition to build and run a small supercomputer cluster —a high-performance network used to perform intensive calculations for complex data sets such as weather forecasts or nuclear fusion.
Four national teams, including the U. students and a team from Skyline High School in Salt Lake City, were given identical components and two days to assemble and deploy a supercomputing cluster for a specific task. The competition, called the "LittleFe Challenge," was part of SC12, the annual international supercomputing conference held this year in Salt Lake City.
Utah computer science students Leif Andersen, Bruce Bolick, Ian King, Tom Robertson, Kathryn Rodgers and Tyler Sorenson were members of the winning team.
The competition involved what is known as the traveling salesman problem.
Three sets of cities and coordinates were given to each team. The students were then asked to use their small supercomputer to find the shortest route for a traveling salesman to take that would include a visit to each city once and a return to the city of origin for each data set using their cluster. The teams were judged on best score, visualization of their results and their knowledge of high-performance computing.
Brian Haymore, Martin Cuma and Wim Cardoen from the U’s Center for High Performance Computing were mentors to the team. Their faculty advisor was Mary Hall, a computer science professor.