Falguni Sarkar

Learn More
We introduce a new class of fixed-degree in-terconnection networks, called the Cayley graph connected cycles , which includes the well known cube-connected cycles as a special case. This class of networks is shown to be vertex-symmetric and maximally fault tolerant (if the given Cayley graph is maximally fault tolerant). We propose simple routing and(More)
Load balanced data distribution among various memory modules in a multiprocessor architecture or among multiple disks in a parallel I/O subsystem is an important problem. The goal is to provide parallel access without memory conflicts to specified templates of a host data structure, using as few modules or disks as possible. An efficient solution to this(More)
  • 1