All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids

s: An Abstraction for Data Intensive Computing on Campus Grids Christopher Moretti, Hoang Bui, Karen Hollingsworth, Brandon Rich, Patrick Flynn, and Douglas Thain Department of Computer Science and Engineering, University of Notre Dame — Today, campus grids provide users with easy access to thousands of CPUs. However, it is not always easy for nonexpert users to harness these systems effectively. A large workload composed in what seems to be the obvious way by a naive user may accidentally abuse shared resources and achieve very poor performance. To address this problem, we argue that campus ould provide end users with high-level abstractions that allow for the easy expression and efficient execution of data e workloads. We present one example of an abstraction – All-Pairs – that fits the needs of several applications in biometrics, bioinformatics, and data mining. We demonstrate that ized All-Pairs abstraction is both easier to use than the underlying system, achieves performa...

• Type: Journal
• Year: 2010
• Where: TPDS
• Authors: Christopher Moretti, Hoang Bui, Karen Hollingsworth, Brandon Rich, Patrick J. Flynn, Douglas Thain
• Keywords: Abstraction, Campus, Douglas Thain Department, TPDS 2010