Search Results - "Yoo, Andy"

Refine Results
  1. 1

    Performance Comparison of Coscheduling Algorithms for Non-Dedicated Clusters Through a Generic Framework by Choi, Gyu Sang, Agarwal, Saurabh, Kim, Jin-Ha, Das, Chita R., Yoo, Andy B.

    “…In this paper, we address several key issues in designing coscheduling algorithms for clusters. First, we propose a generic framework for deploying…”
    Get full text
    Journal Article
  2. 2

    A comprehensive performance and energy consumption analysis of scheduling alternatives in clusters by GYU SANG CHOI, KIM, Jin-Ha, ERSOZ, Deniz, YOO, Andy B, DAS, Chita R

    Published in The Journal of supercomputing (01-05-2007)
    “…In this paper, we conduct an in-depth evaluation of a broad spectrum of scheduling alternatives for clusters. These include the widely used batch scheduling,…”
    Get full text
    Journal Article
  3. 3

    Scalable Analysis of Massive Graphs on a Parallel Data Flow System by Yoo, A.

    “…The feasibility of using dataflow systems for running complex graph queries is studied in this paper. A general query optimization framework for parallel…”
    Get full text
    Conference Proceeding
  4. 4

    Hardware Technologies for High-Performance Data-Intensive Computing by Gokhale, M., Cohen, J., Yoo, A., Miller, W.M., Jacob, A., Ulmer, C., Pearce, R.

    Published in Computer (Long Beach, Calif.) (01-04-2008)
    “…Data-intensive problems challenge conventional computing architectures with demanding CPU, memory, and I/O requirements. Experiments with three benchmarks…”
    Get full text
    Journal Article
  5. 5

    Aluminum: An Asynchronous, GPU-Aware Communication Library Optimized for Large-Scale Training of Deep Neural Networks on HPC Systems by Dryden, Nikoli, Maruyama, Naoya, Moon, Tim, Benson, Tom, Yoo, Andy, Snir, Marc, Van Essen, Brian

    “…We identify communication as a major bottleneck for training deep neural networks on large-scale GPU clusters, taking over 10x as long as computation. To…”
    Get full text
    Conference Proceeding
  6. 6
  7. 7

    Coscheduling in Clusters: Is It a Viable Alternative? by Choi, Gyu Sang, Kim, Jin-Ha, Ersoz, Deniz, Yoo, Andy B., Das, Chita R.

    “…In this paper, we conduct an in-depth evaluation of a broad spectrum of scheduling alternatives for clusters. These include the widely used batch scheduling,…”
    Get full text
    Conference Proceeding
  8. 8

    Parallel Generation of Massive Scale-Free Graphs by Yoo, Andy, Henderson, Keith

    Published 18-03-2010
    “…One of the biggest huddles faced by researchers studying algorithms for massive graphs is the lack of large input graphs that are essential for the development…”
    Get full text
    Journal Article
  9. 9

    A scalable eigensolver for large scale-free graphs using 2D graph partitioning by Yoo, Andy, Baker, Allison H., Pearce, Roger, Van Emden Henson

    “…Eigensolvers are important tools for analyzing and mining useful information from scale-free graphs. Such graphs are used in many applications and can be…”
    Get full text
    Conference Proceeding
  10. 10

    MSSG: A Framework for Massive-Scale Semantic Graphs by Hartley, T.D.R., Umit Catalyurek, Ozguner, F., Yoo, A., Kohn, S., Henderson, K.

    “…This paper presents a middleware framework for storing, accessing and analyzing massive-scale semantic graphs. The framework, MSSG, targets scale-free semantic…”
    Get full text
    Conference Proceeding
  11. 11

    A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L by Yoo, Andy, Chow, Edmond, Henderson, Keith, McLendon, William, Hendrickson, Bruce, Catalyurek, Umit

    “…Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a…”
    Get full text
    Conference Proceeding
  12. 12

    Parallel massive scale-free graph generators by Yoo, Andy, Henderson, Keith

    “…The lack of publicly available large scale-free graphs forces researchers studying massive scale-free graphs to rely on synthetically generated graphs in…”
    Get full text
    Conference Proceeding
  13. 13

    A New Benchmark For Evaluation Of Graph-Theoretic Algorithms by Yoo, Andy B, Liu, Yang, Vaidya, Sheila, Poole, Stephen

    Published 05-05-2010
    “…We propose a new graph-theoretic benchmark in this paper. The benchmark is developed to address shortcomings of an existing widely-used graph benchmark. We…”
    Get full text
    Journal Article
  14. 14

    Co-ordinated coscheduling in time-sharing clusters through a generic framework by Agarwal, Yoo, Gyu Sang Choi, Das, Nagar

    “…In this paper, we attempt to address several key issues in designing coscheduling algorithms for clusters. First, we propose a generic framework for deploying…”
    Get full text
    Conference Proceeding
  15. 15

    Processing massive sized graphs using Sector/Sphere by Yunhong Gu, Li Lu, Grossman, R, Yoo, A

    “…Data intensive computing is having an increasing awareness among computer science researchers. As the data size increases even faster than Moore's Law, many…”
    Get full text
    Conference Proceeding
  16. 16

    An Empirical Performance Evaluation of Scalable Scientific Applications by Vetter, J.S., Yoo, A.

    “…We investigate the scalability, architectural requirements,a nd performance characteristics of eight scalable scientific applications. Our analysis is driven…”
    Get full text
    Conference Proceeding
  17. 17
  18. 18

    METRIC: tracking down inefficiencies in the memory hierarchy via binary rewriting by Marathe, Jaydeep, Mueller, Frank, Mohan, Tushar, de Supinski, Bronis R., McKee, Sally A., Yoo, Andy

    “…In this paper, we present METRIC, an environment for determining memory inefficiencies by examining data traces. METRIC is designed to alter the performance…”
    Get full text
    Conference Proceeding
  19. 19
  20. 20

    Identifying and Exploiting Spatial Regularity in Data Memory References by Mohan, Tushar, Supinski, Bronis R. de, McKee, Sally A., Mueller, Frank, Yoo, Andy, Schulz, Martin

    Published in ACM/IEEE SC 2003 Conference (SC'03) (15-11-2003)
    “…The growing processor/memory performance gap causes the performance of many codes to be limited by memory accesses. If known to exist in an application,…”
    Get full text
    Conference Proceeding