6 research outputs found

    How Are We Doing? A Self-Assessment of the Quality of Services andSystems at NERSC, 2005-2006

    Full text link

    How are we doing? A self-assessment of the quality of services and systems at NERSC (2001)

    Full text link

    LDRD report : parallel repartitioning for optimal solver performance.

    Full text link

    Communication Support for Adaptive Computation\Lambda

    No full text
    Ali Pinary and Bruce Hendricksonz 1 Introduction In this work we address two problems associated with redistributing data amongst processors. The first problem is that of determining the inter-processor communication pattern necessary to perform a calculation like matrix-vector multiplication. Consider the situation when a calculation is first described or when it is repartitioned after dynamic load balancing. Processors do not know what communication operations to perform to enable the matrix-vector multiplication to proceed. Assuming the matrix is partitioned by rows, looking at its own domain allows each processor can determine what it wants to receive, but it does not know which processor owns these desired data. We propose a distributed directory algorithm to efficiently determine the communication pattern (i.e., what a processor needs to receive from and send to every other processor). Our experiments show that the proposed algorithm performs efficiently on large numbers of processors
    corecore