Input/Output is a big obstacle to effective use of tenflopsscale computing systems, Motivated by earlier parallel I/O meaurements on an Intel TFLOPS machine, we conduct studies to determine theâ€¦ (More)

We consider the problem of determining the minimum number of faulty processors, (n;m), and of faulty links, (n;m), in an n-dimensional hypercube computer so that every m-dimensional subcube isâ€¦ (More)

A dominating setS of a graphG is perfectif each vertex ofG is dominated by exactly one vertex in S. We study the existence and construction of PDSs in families of graphs arising from theâ€¦ (More)

One important aspect of efficient use of a hypercube computer to solve a given problem is the assignment of subtasks to processors in such a way that the communication overhead is low. The subtasksâ€¦ (More)

Cube-connected cycles are a family of cubic graphs with relatively small diameters and regular structure, making them attractive models for parallel architecture design. The existence of perfectâ€¦ (More)

Large-scale ecological simulations are natural candidates for distributed discrete event simulation. In optimistic simulation of spatially explicit models, a difficult problem arises when individualsâ€¦ (More)

LetG be a graph and let P (n) denote an element from a one-parameter family of graphs, such as a path of lengthn, a cycle of lengthn, or a complete binary tree of height n. We are concerned withâ€¦ (More)

We consider the problem of subsystem allocation in the mesh, torus, and hypercube multicomputers. Although the usual practice is to use a serial algorithm on the host processor to do the allocation,â€¦ (More)