Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...
In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two models, namely...
We have designed, built, and analyzed a distributed parallel storage system that will supply image streams fast enough to permit multi-user, "real-time", video-like appl...
Brian Tierney, Jason Lee, Ling Tony Chen, Hanan He...