Search For:

Displaying 1-12 out of 12 total
Scheduling resizable parallel applications
Found in: Parallel and Distributed Processing Symposium, International
By Rajesh Sudarsan,Calvin J. Ribbens
Issue Date:May 2009
pp. 1-10
Most conventional parallel job schedulers only support static scheduling thereby restricting schedulers from being able to modify the number of processors allocated to parallel applications at runtime. The drawbacks of static scheduling can be overcome by ...
 
Is It Time to Rethink Distributed Shared Memory Systems?
Found in: Parallel and Distributed Systems, International Conference on
By Bharath Ramesh,Calvin J. Ribbens,Srinidhi Varadarajan
Issue Date:December 2011
pp. 212-219
We present core elements of Samhita, a new user level software distributed shared memory (DSM) system. Our work is motivated by two observations. First, the rise of many-core architectures is producing a growing emphasis on threaded codes to achieve perfor...
 
Regional Consistency: Programmability and Performance for Non-cache-coherent Systems
Found in: 2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)
By Bharath Ramesh,Calvin J. Ribbens,Srinidhi Varadarajan
Issue Date:July 2013
pp. 941-948
Parallel programmers face the often irreconcilable goals of programmability and performance. HPC systems use distributed memory for scalability, thereby sacrificing the programmability advantages of shared memory programming models. Furthermore, the rapid ...
 
ReSHAPE: A Framework for Dynamic Resizing and Scheduling of Homogeneous Applications in a Parallel Environment
Found in: Parallel Processing, International Conference on
By Rajesh Sudarsan, Calvin J. Ribbens
Issue Date:September 2007
pp. 44
A traditional application scheduler running on a parallel cluster only supports static scheduling where the number of processors allocated to an application remains fixed throughout the lifetime of the job. Due to unpredictability in job arrival times and ...
 
Towards Virtual Shared Memory for Non-cache-coherent Multicore Systems
Found in: 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)
By Bharath Ramesh,Calvin J. Ribbens,Srinidhi Varadarajan
Issue Date:May 2013
pp. 1186-1193
Emerging heterogeneous architectures do not necessarily provide cache-coherent shared memory across all components of the system. Although there are good reasons for this architectural decision, it does provide programmers with a challenge. Several program...
 
Adaptive Code Collage: A Framework to Transparently Modify Scientific Codes
Found in: Computing in Science and Engineering
By Pilsung Kang,Naren Ramakrishnan,Calvin J. Ribbens,Srinidhi Varadarajan,Michael Heffner
Issue Date:January 2012
pp. 52-63
Legacy scientific codes are often repurposed to fit adaptive needs, but making such code adaptive without changing the original source programs can be challenging. Adaptive Code Collage (ACC) meets this challenge using function-call interception in a langu...
 
Pattern-based sparse matrix representation for memory-efficient SMVM kernels
Found in: Proceedings of the 23rd international conference on Supercomputing (ICS '09)
By Calvin J. Ribbens, Godmar Back, Mehmet Belgin
Issue Date:June 2009
pp. 1-1
Pattern-based Representation (PBR) is a novel approach to improving the performance of Sparse Matrix-Vector Multiply (SMVM) numerical kernels. Motivated by our observation that many matrices can be divided into blocks that share a small number of distinct ...
     
Modular implementation of adaptive decisions in stochastic simulations
Found in: Proceedings of the 2009 ACM symposium on Applied Computing (SAC '09)
By Calvin J. Ribbens, Naren Ramakrishnan, Pilsung Kang, Srinidhi Varadarajan, Yang Cao
Issue Date:March 2009
pp. 1-5
We present a modular approach to implement adaptive decisions with existing scientific codes. Using a sophisticated system software tool based on the function call interception technique, an external code module is transparently combined with the given pro...
     
A fast adaptive grid scheme for elliptic partial differential equations
Found in: ACM Transactions on Mathematical Software (TOMS)
By Calvin J. Ribbens
Issue Date:March 1988
pp. 179-197
We describe the Recursive Subdivision (RS) method-an efficient and effective adaptive grid scheme for two-dimensional elliptic partial differential equations (PDEs). The RS method generates a new grid by recursively subdividing a rectangular domain. We use...
     
Mining and visualizing recommendation spaces for elliptic PDEs with continuous attributes
Found in: ACM Transactions on Mathematical Software (TOMS)
By Calvin J. Ribbens, Naren Ramakrishnan
Issue Date:March 1988
pp. 254-273
In this paper we extend previous work in mining recommendation spaces based on symbolic problem features to PDE problems with continuous-valued attributes. We identify the research issues in mining such spaces, present a dynamic programming algorithm form ...
     
Toward parallel mathematical software for elliptic partial differential equations
Found in: ACM Transactions on Mathematical Software (TOMS)
By Calvin J. Ribbens, Colin Desa, Layne T. Watson
Issue Date:March 1988
pp. 457-473
Three approaches to parallelizing important components of the mathematical software package ELLPACK are considered: an explicit approach using compiler directives available only on the target machine, an automatic approach using an optimizing and paralleli...
     
Interactive ELLPACK: an interactive problem-solving environment for elliptic partial differential equations
Found in: ACM Transactions on Mathematical Software (TOMS)
By Calvin J. Ribbens, Wayne R. Dyksen
Issue Date:June 1987
pp. 113-132
ELLPACK is a versatile, very high-level language for solving elliptic partial differential equations. Solving elliptic problems with ELLPACK typically involves a process in which one repeatedly computes a solution, analyzes the results, and modifies the so...
     
 1