Li X.,Center for Computation and Technology |
Iyengar S.S.,Florida International University
ACM Computing Surveys | Year: 2015
We review the computation of 3D geometric data mapping, which establishes one-to-one correspondence between or among spatial/spatiotemporal objects. Effectivemapping benefitsmany scientific and engineering tasks that involve the modeling and processing of correlated geometric or image data. We model mapping computation as an optimization problem with certain geometric constraints and go through its general solving pipeline. Different mapping algorithms are discussed and compared according to their formulations of objective functions, constraints, and optimization strategies. © 2014 ACM.
Ko S.-H.,National Supercomputing Center |
Kim N.,Center for Computation and Technology |
Jha S.,Center for Computation and Technology
ASME-JSME-KSME 2011 Joint Fluids Engineering Conference, AJK 2011 | Year: 2011
We propose numerical approaches to reduce the sampling noise of a hybrid computational fluid dynamics (CFD)-molecular dynamics (MD) solution. A hybrid CFD-MD approach provides higher-resolution solution near the solid obstacle and better efficiency than a pure particle-based simulation technique. However, applications up to now are limited to extreme velocity conditions, since the magnitude of statistical error in sampling particles' velocity is very large compared to the continuum velocity. Considering technical difficulties of infinitely increasing MD domain size, we propose and experiment a number of numerical alternatives to suppress the excessive sampling noise in solving moderatevelocity flow field. They are the sampling of multiple replicas, virtual stretching of sampling layers in space, and linear fitting of multiple temporal samples. We discuss the pros and cons of each technique in view of solution accuracy and computational cost. Copyright © 2011 by ASME.
Thota A.,Center for Computation and Technology |
Thota A.,Louisiana State University |
Luckow A.,Center for Computation and Technology |
Jha S.,Center for Computation and Technology |
Jha S.,Rutgers University
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | Year: 2011
Replica-exchange (RE) algorithms are used to understand physical phenomena-ranging from protein folding dynamics to binding affinity calculations. They represent a class of algorithms that involve a large number of loosely coupled ensembles, and are thus amenable to using distributed resources. We develop a framework for RE that supports different replica pairing (synchronous versus asynchronous) and exchange coordination mechanisms (centralized versus decentralized) and which can use a range of production cyberinfrastructures concurrently. We characterize the performance of both RE algorithms at an unprecedented number of cores employed-the number of replicas and the typical number of cores per replica-on the production distributed infrastructure. We find that the asynchronous algorithms outperform the synchronous algorithms, even though details of the specific implementations are important determinants of performance. © 2011 The Royal Society.
Miceli C.,Center for Computation and Technology |
Miceli M.,Center for Computation and Technology |
Rodriguez-Milla B.,Center for Computation and Technology |
Jha S.,Center for Computation and Technology |
Jha S.,Louisiana State University
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | Year: 2010
Grids, clouds and cloud-like infrastructures are capable of supporting a broad range of data-intensive applications. There are interesting and unique performance issues that appear as the volume of data and degree of distribution increases. New scalable data-placement and management techniques, as well as novel approaches to determine the relative placement of data and computational workload, are required. We develop and study a genome sequence matching application that is simple to control and deploy, yet serves as a prototype of a data-intensive application. The application uses a SAGA-based implementation of the All-Pairs pattern. This paper aims to understand some of the factors that influence the performance of this application and the interplay of those factors. We also demonstrate how the SAGA approach can enable data-intensive applications to be extensible and interoperable over a range of infrastructure. This capability enables us to compare and contrast two different approaches for executing distributed data-intensive applications-simple application-level data-placement heuristics versus distributed file systems. © 2010 The Royal Society.
Ullmer B.,Louisiana State University |
Ullmer B.,Center for Computation and Technology |
Dell C.,Louisiana State University |
Dell C.,Center for Computation and Technology |
And 23 more authors.
Proceedings of the 5th International Conference on Tangible Embedded and Embodied Interaction, TEI'11 | Year: 2011
Casiers are a class of tangible interface elements that structure the physical and functional composition of tangibles and complementary interactors (e.g., buttons and sliders). Casiers allow certain subsets of interactive functionality to be accessible across diverse interactive systems (with and without graphical mediation, employing varied sensing capabilities and supporting software). We illustrate examples of casiers in use, including iterations around a custom walk-up-and-use kiosk, as well as casiers operable across commercial platforms of widely varying cost and capability. © 2011 ACM.