Search For:

Displaying 1-18 out of 18 total
Mapping High-Fidelity Volume Rendering for Medical Imaging to CPU, GPU and Many-Core Architectures
Found in: IEEE Transactions on Visualization and Computer Graphics
By Mikhail Smelyanskiy, David Holmes, Jatin Chhugani, Alan Larson, Douglas M. Carmean, Dennis Hanson, Pradeep Dubey, Kurt Augustine, Daehyun Kim, Alan Kyker, Victor W. Lee, Anthony D. Nguyen, Larry Seiler, Richard Robb
Issue Date:November 2009
pp. 1563-1570
Medical volumetric imaging requires high fidelity, high performance rendering algorithms. We motivate and analyze new volumetric rendering algorithms that are suited to modern parallel processing architectures. First, we describe the three major categories...
 
Large-scale energy-efficient graph traversal: A path to efficient data-intensive supercomputing
Found in: 2012 SC - International Conference for High Performance Computing, Networking, Storage and Analysis
By Nadathur Satish,Changkyu Kim,Jatin Chhugani,Pradeep Dubey
Issue Date:November 2012
pp. 1-11
Graph traversal is a widely used algorithm in a variety of fields, including social networks, business analytics, and high-performance computing among others. There has been a push for HPC machines to be rated not just in Petaflops, but also in "GigaT...
 
Billion-particle SIMD-friendly two-point correlation on large-scale HPC cluster systems
Found in: 2012 SC - International Conference for High Performance Computing, Networking, Storage and Analysis
By Jatin Chhugani,Changkyu Kim,Hemant Shukla,Jongsoo Park,Pradeep Dubey,John Shalf,Horst D. Simon
Issue Date:November 2012
pp. 1-11
Two-point Correlation Function (TPCF) is widely used in astronomy to characterize the distribution of matter/energy in the Universe, and help derive the physics that can trace back to the creation of the universe. However, it is prohibitively slow for curr...
 
DySER: Unifying Functionality and Parallelism Specialization for Energy-Efficient Computing
Found in: IEEE Micro
By Venkatraman Govindaraju,Chen-Han Ho,Tony Nowatzki,Jatin Chhugani,Nadathur Satish,Karthikeyan Sankaralingam,Changkyu Kim
Issue Date:September 2012
pp. 38-51
The DySER (Dynamically Specializing Execution Resources) architecture supports both functionality specialization and parallelism specialization. By dynamically specializing frequently executing regions and applying parallelism mechanisms, DySER provides ef...
 
Fast and Efficient Graph Traversal Algorithm for CPUs: Maximizing Single-Node Efficiency
Found in: 2012 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)
By Jatin Chhugani,Nadathur Satish,Changkyu Kim,Jason Sewall,Pradeep Dubey
Issue Date:May 2012
pp. 378-389
Graph-based structures are being increasingly used to model data and relations among data in a number of fields. Graph-based databases are becoming more popular as a means to better represent such data. Graph traversal is a key component in graph algorithm...
 
High-performance lattice QCD for multi-core based parallel systems using a cache-friendly hybrid threaded-MPI approach
Found in: SC Conference
By Mikhail Smelyanskiy,Karthikeyan Vaidyanathan,Jee Choi,Bálint Joó,Jatin Chhugani,Michael A. Clark,Pradeep Dubey
Issue Date:November 2011
pp. 1-11
Lattice Quantum Chromo-dynamics (LQCD) is a computationally challenging problem that solves the discretized Dirac equation in the presence of an SU(3) gauge field. Its key operation is a matrix-vector product, known as the Dslash operator. We have develope...
 
Second Life and the New Generation of Virtual Worlds
Found in: Computer
By Sanjeev Kumar, Jatin Chhugani, Changkyu Kim, Daehyun Kim, Anthony Nguyen, Pradeep Dubey, Christian Bienia, Youngmin Kim
Issue Date:September 2008
pp. 46-53
Unlike online games, metaverses present a single seamless, persistent world where users can transparently roam around without predefined objectives. An analysis of Second Life illustrates the demands such applications place on clients, servers, and the net...
 
Atomic Vector Operations on Chip Multiprocessors
Found in: Computer Architecture, International Symposium on
By Sanjeev Kumar, Daehyun Kim, Mikhail Smelyanskiy, Yen-Kuang Chen, Jatin Chhugani, Christopher J. Hughes, Changkyu Kim, Victor W. Lee, Anthony D. Nguyen
Issue Date:June 2008
pp. 441-452
The current trend is for processors to deliver dramatic improvements in parallel performance while only modestly improving serial performance. Parallel performance is harvested through vector/SIMD instructions as well as multithreading (through both multit...
 
vLOD: High-Fidelity Walkthrough of Large Virtual Environments
Found in: IEEE Transactions on Visualization and Computer Graphics
By Jatin Chhugani, Budirijanto Purnomo, Shankar Krishnan, Jonathan Cohen, Suresh Venkatasubramanian, David S. Johnson, Subodh Kumar
Issue Date:January 2005
pp. 35-47
We present visibility computation and data organization algorithms that enable high-fidelity walkthroughs of large 3D geometric data sets. A novel feature of our walkthrough system is that it performs work proportional only to the required detail in visibl...
 
3.5-D Blocking Optimization for Stencil Computations on Modern CPUs and GPUs
Found in: SC Conference
By Anthony Nguyen, Nadathur Satish, Jatin Chhugani, Changkyu Kim, Pradeep Dubey
Issue Date:November 2010
pp. 1-13
Stencil computation sweeps over a spatial grid over multiple time steps to perform nearest-neighbor computations. The bandwidth-to-compute requirement for a large class of stencil kernels is very high, and their performance is bound by the available memory...
 
Can traditional programming bridge the Ninja performance gap for parallel computing applications?
Found in: Proceedings of the 39th Annual International Symposium on Computer Architecture (ISCA '12)
By Changkyu Kim, Hideki Saito, Jatin Chhugani, Mikhail Smelyanskiy, Milind Girkar, Nadathur Satish, Pradeep Dubey, Rakesh Krishnaiyer
Issue Date:June 2012
pp. 440-451
Current processor trends of integrating more cores with wider SIMD units, along with a deeper and complex memory hierarchy, have made it increasingly more challenging to extract performance from applications. It is believed by some that traditional approac...
     
Designing fast architecture-sensitive tree search on modern multicore/many-core processors
Found in: ACM Transactions on Database Systems (TODS)
By Anthony D. Nguyen, Changkyu Kim, Eric Sedlar, Jatin Chhugani, Nadathur Satish, Pradeep Dubey, Scott A. Brandt, Tim Kaldewey, Victor W. Lee
Issue Date:December 2011
pp. 1-34
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vector units. There has been much work to exploit modern processor architectures ...
     
Debunking the 100X GPU vs. CPU myth: an evaluation of throughput computing on CPU and GPU
Found in: Proceedings of the 37th annual international symposium on Computer architecture (ISCA '10)
By Anthony D. Nguyen, Changkyu Kim, Daehyun Kim, Jatin Chhugani, Michael Deisher, Mikhail Smelyanskiy, Nadathur Satish, Per Hammarlund, Pradeep Dubey, Ronak Singhal, Srinivas Chennupaty, Victor W. Lee
Issue Date:June 2010
pp. 72-ff
Recent advances in computing have led to an explosion in the amount of data being generated. Processing the ever-growing data in a timely manner has made throughput computing an important aspect for emerging applications. Our analysis of a set of important...
     
ClearPath: highly parallel collision avoidance for multi-agent simulation
Found in: Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA '09)
By Changkyu Kim, Dinesh Manocha, Jatin Chhugani, Ming Lin, Nadathur Satish, Pradeep Dubey, Stephen. J. Guy
Issue Date:August 2009
pp. 177-187
We present a new local collision avoidance algorithm between multiple agents for real-time simulations. Our approach extends the notion of velocity obstacles from robotics and formulates the conditions for collision free navigation as a quadratic optimizat...
     
Physical simulation for animation and visual effects: parallelization and characterization for chip multiprocessors
Found in: Proceedings of the 34th annual international symposium on Computer architecture (ISCA '07)
By Andrew P. Selle, Christopher J. Hughes, Daehyun Kim, Eftychios Sifakis, Jatin Chhugani, Matthew Holliman, Radek Grzeszczuk, Sanjeev Kumar, Yen-Kuang Chen
Issue Date:June 2007
pp. 220-231
We explore the emerging application area of physics-based simulation for computer animation and visual special effects. In particular, we examine its parallelization potential and characterize its behavior on a chip multiprocessor (CMP). Applications in th...
     
Geometry engine optimization: cache friendly compressed representation of geometry
Found in: Proceedings of the 2007 symposium on Interactive 3D graphics and games (SI3D '07)
By Jatin Chhugani, Subodh Kumar
Issue Date:April 2007
pp. 9-16
Recent advances in graphics architecture focus on improving texture performance and pixel processing. These have paralleled advances in rich pixel shading algorithms for realistic images. However, applications that require significantly more geometry proce...
     
Budget sampling of parametric surface patches
Found in: Proceedings of the 2003 symposium on Interactive 3D graphics (SI3D '03)
By Jatin Chhugani, Subodh Kumar
Issue Date:April 2003
pp. 131-138
We investigate choosing point samples on a model comprising parametric patches to meet a user specified budget. These samples may then be triangulated, rendered as points or ray-traced. The main idea is to pre-compute a set of samples on the surface and at...
     
View-dependent adaptive tessellation of spline surfaces
Found in: Proceedings of the 2001 symposium on Interactive 3D graphics (SI3D '01)
By Jatin Chhugani, Subodh Kumar
Issue Date:March 2001
pp. 59-62
we present an exact and interactive collision detection system, I-COLLIDE, for large-scale environments. Such environments are characterized by the number of objects undergoing rigid motion and the complexity of the models. The algorithm does not assume th...
     
 1