Search Results - "Yoo, Andy"
-
1
Performance Comparison of Coscheduling Algorithms for Non-Dedicated Clusters Through a Generic Framework
Published in The international journal of high performance computing applications (01-04-2007)“…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
A comprehensive performance and energy consumption analysis of scheduling alternatives in clusters
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
Scalable Analysis of Massive Graphs on a Parallel Data Flow System
Published in 2010 43rd Hawaii International Conference on System Sciences (01-01-2010)“…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
Hardware Technologies for High-Performance Data-Intensive Computing
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
Aluminum: An Asynchronous, GPU-Aware Communication Library Optimized for Large-Scale Training of Deep Neural Networks on HPC Systems
Published in 2018 IEEE/ACM Machine Learning in HPC Environments (MLHPC) (01-11-2018)“…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
Hardware Technologies for High-Performance Data-Intensive Computing : Data-intensive computing
Published in Computer (Long Beach, Calif.) (2008)Get full text
Journal Article -
7
Coscheduling in Clusters: Is It a Viable Alternative?
Published in Conference on High Performance Networking and Computing: Proceedings of the 2004 ACM/IEEE conference on Supercomputing; 06-12 Nov. 2004 (06-11-2004)“…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
Parallel Generation of Massive Scale-Free Graphs
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
A scalable eigensolver for large scale-free graphs using 2D graph partitioning
Published in 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) (12-11-2011)“…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
MSSG: A Framework for Massive-Scale Semantic Graphs
Published in 2006 IEEE International Conference on Cluster Computing (01-09-2006)“…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
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Published in ACM/IEEE SC 2005 Conference (SC'05) (2005)“…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
Parallel massive scale-free graph generators
Published in Conference on High Performance Networking and Computing: Proceedings of the 2006 ACM/IEEE conference on Supercomputing; 11-17 Nov. 2006 (11-11-2006)“…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
A New Benchmark For Evaluation Of Graph-Theoretic Algorithms
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
Co-ordinated coscheduling in time-sharing clusters through a generic framework
Published in 2003 Proceedings IEEE International Conference on Cluster Computing (2003)“…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
Processing massive sized graphs using Sector/Sphere
Published in 2010 3rd Workshop on Many-Task Computing on Grids and Supercomputers (01-11-2010)“…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
An Empirical Performance Evaluation of Scalable Scientific Applications
Published in ACM/IEEE SC 2002 Conference (SC'02) (2002)“…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
An empirical performance evaluation of scalable scientific applications
Published in Proceedings of the 2002 ACM/IEEE conference on Supercomputing (16-11-2002)Get full text
Conference Proceeding -
18
METRIC: tracking down inefficiencies in the memory hierarchy via binary rewriting
Published in Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization (23-03-2003)“…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
-
20
Identifying and Exploiting Spatial Regularity in Data Memory References
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