Ahmad Chadi, A Jundi, Jean-luc Dekeyser, Isaac D. Scherson
Interconnection network performance is a key factor when constructing parallel computers. The choice of an interconnection network used in a parallel computer depends on a large number of performance...
A Study of an Evaluation Methodology for Unbuffered Multistage Interconnection Networks (2003)
Ahmad Chadi Aljundi, Jean-luc Dekeyser, M-tahar Kechadi, Isaac D. Scherson
Interconnection network performance is a key factor when constructing parallel computers. The choice of an interconnection network used in a parallel computer depends on a large number of performance...
Comparative Simulations and Performance Evaluation of MCRB (2003)
Ahmad Chadi Aljundi, Jean-luc Dekeyser, Isaac D. Scherson, De Lille
Interconnection networks[24] play a principal role in today 's parallel computers, which in turn are becoming a very important utility to solve today's scienti c problems needing more and more...
An Operating System Framework for Large Parallel Computers (2002)
Isaac D. Scherson, Piotr Chrzastowski-wachtel, Dinesh Ramanathan, Raghu Subramanian, Vara Ramakrishnan, Veronica L. M. Reis
Little work has been done on operating systems for massively parallel computing. This paper proposes a framework for such an operating system. It is assumed that there are multiple jobs executing on...
A Virtual Memory Model for Parallel Supercomputers (2002)
Ver Onica L. M. Reis, Isaac D. Scherson
A model for virtual memory in a distributed memory parallel computer is proposed. It uses a novel parallel computing operating system framework and leads to the definition of two strategies for...
A Modular Client-Server Discrete Event Simulator for Networked Computers (2002)
David Wangerin, Christopher Decoro, Luis M. Campos, Hugo Coyote, Isaac D. Scherson
A novel simulation framework is described that uses a client-server paradigm combined with a discrete event simulator to allow the simulation modules to be distributed around a centralized core. The...
A Statistical Mechanical Approach to a Framework for Modeling Irregular (2002)
Shean T. Mcmahon, Isaac D. Scherson
Correctly modeling the resource requirements of a computer program is made problematic by the property of irregularity. Irregular computer programs are ones in which modeling the program before...
Simulation-Based Average Case Analysis for Parallel Job Scheduling (2001)
Fabricio Alves, Barbosa Silva, Isaac D. Scherson
This paper analyses the resource allocation problem in parallel jobs scheduling, with emphasis given to gang service algorithms. Gang service has been widely used as a practical solution to the...
Efficient Parallel Job Scheduling Using Gang Service (2001)
Fabricio Alves, Barbosa Silva, Universite Pierre, Marie Curie, Isaac D. Scherson
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. To overcome some of the limitations of traditional Gang scheduling algorithms, Concurrent...
Improving Parallel Job Scheduling Using Runtime Measurements (2000)
Fabricio Alves, Barbosa Silva, Isaac D. Scherson
. We investigate the use of runtime measurements to improve job scheduling on a parallel machine. Emphasis is on gang scheduling based strategies. With the information gathered at runtime, we define...
Improving Parallel Job Scheduling Using Runtime Measurements (2000)
Fabricio Alves, Barbosa Silva, Isaac D. Scherson
. We investigate in this paper the use of runtime measurements to improve job scheduling on a parallel machine. Emphasis is on gang scheduling based strategies. With the information gathered at...
Efficient Techniques for Fast Nested Barrier Synchronization (2000)
Vara Ramakrishnan, Isaac D. Scherson, Raghu Subramanian
Two hardware barrier synchronization schemes are presented which can support deep levels of control nesting in data parallel programs. Hardware barriers are usually an order of magnitude faster than...
Executing Communication-Intensive Irregular Programs Eciently (2000)
Vara Ramakrishnan, Isaac D. Scherson
. We consider the problem of eciently executing completely irregular, communication-intensive parallel programs. Completely irregular programs are those whose number of parallel threads as well as...
Bounds on Gang Service Scheduling (1999)
Fabricio Alves, Barbosa Silva, Isaac D. Scherson
We define the bounds of two gang service algorithms, namely time balanced and instruction balanced, using interactivity and throughput based metrics. The workload is composed of V-RAM jobs, and the...
Towards Flexibility and Scalability in Parallel Job Scheduling (1999)
Fabricio Alves, Barbosa Silva, Isaac D. Scherson
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel tasks of a job are scheduled for simultaneous execution on a partition of a...
Concurrent Gang: Towards a Flexible and (1999)
Fabricio Alves, Barbosa Silva, Isaac D. Scherson
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel tasks of a job are scheduled for simultaneous execution on a partition of a...
Improvements in Parallel Job Scheduling Using Gang Service (1999)
Fabricio Alves, Barbosa Silva, Isaac D. Scherson
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel...
Bounds on Gang Service Scheduling (1999)
Fabricio Alves, Barbosa Silva, Isaac D. Scherson
We define the bounds of two gang service algorithms, namely time balanced and instruction balanced, using interactivity and throughput based metrics. The workload is composed of V-RAM jobs, and the...
Concurrent Gang: Towards a Flexible and Scalable Gang Scheduler (1999)
Fabricio Alves, Barbosa Silva, Isaac D. Scherson
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel tasks of a job are scheduled for simultaneous execution on a partition of a...
Improvements in Parallel Job Scheduling Using Gang Service (1999)
Fabricio Alves, Barbosa Silva, Isaac D. Scherson
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel...
Efficient Techniques for Nested and Disjoint Barrier Synchronization (1999)
Isaac D. Scherson, Raghu Subramanian, Vara Ramakrishnan
Current MIMD computers support the execution of data parallel programs by providing a tree network to perform fast barrier synchronizations. However, there are two major limitations to using tree...
Parallel Virtual Memory for Time Shared Environments (1999)
Veronica L. M. Reis, Luis Miguel Campos, Isaac D. Scherson
This paper analyses the issues involved in providing virtual distributed shared memory for time-shared parallel machines. We study the performance of two different page management policies, namely,...
Fault Tolerant Parallel Computing in Orthogonal Shared-Memory and Related Architectures. (1998)
Jha, Niraj K., Scherson, Isaac D.
The aim of the research summarized in this final report was to investigate a class of orthogonal shared-memory architectures and interconnection networks, and to obtain generalized methods methods...
A Lower Bound for Dynamic Scheduling of Data Parallel Programs (1998)
Fabricio Alves, Barbosa Silva, Luis Miguel Campos, Isaac D. Scherson
. Instruction Balanced Time Slicing (IBTS) allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however allows for time...
Improvements in Gang Scheduling for Parallel Supercomputers (1998)
Fabricio Alves, Barbosa Silva, Luis Miguel Campos, Isaac D. Scherson
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel...
A Lower Bound for Dynamic Scheduling of Data Parallel Programs (1998)
Fabricio Alves, Barbosa Silva, Luis Miguel Campos, Isaac D. Scherson
. Parallel job scheduling is the problem of how to run a workload of multiple parallel jobs in a single parallel machine. Dynamic means that the possibility of arbitrary arrival times for new jobs is...
Efficient Task Scheduling Heuristic for Multiprocessor Systems (1998)
Isaac D. Scherson, Luis Miguel Campos
The problem of assigning and scheduling parallel job tasks onto multiple processing elements is a complex one and has resulted in numerous heuristics aimed at approximating an optimal solution. A...
A Distributed Dynamic Load Balancing Strategy Based on Rate of Change (1998)
Isaac D. Scherson, Luis Miguel Campos
Dynamic Load Balancing is an important system function destined to distribute workload among available processors to speed up the execution of computer programs whose workload varies at run-time in...
On-Line Scheduling of Parallelizable Jobs (1998)
Christophe Rapine, Isaac D. Scherson
. We consider the problem of efficiently executing a set of parallel jobs on a parallel machine by effectively scheduling the jobs on the computer's resources. This problem is one of optimization of...
Improvements in Gang Scheduling for Parallel Supercomputers (1998)
Fabricio Alves, Barbosa Silva, Luis Miguel Campos, Isaac D. Scherson
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel...
Impacts Of Network Latency On Parallel Virtual Memory Management (1998)
Veronica Lagrange, M. Reis, Isaac D. Scherson
This paper compares the performance of two algorithms to manage parallel virtual memory under different environments. We define parallel virtual memory, show that it may not be implemented as a...
Swap File Organizations in Parallel Virtual Memory Systems (1997)
Isaac D. Scherson, Luis Miguel Campos, Veronica L. M. Reis, Fan Chen, Nucleo De Comp Eletronica
This paper addresses the problem of providing a parallel virtual memory system with an efficient swap file structure. It has been observed, experimentally, that the way data is organized in a...
Least Common Ancestor Networks (1997)
Isaac D. Scherson, Chi-kai Chien
Least Common Ancestor Networks (LCANs) are introduced and shown to be a class of networks that include fat-trees, baseline networks, SW-banyans and the router networks of the TRAC 1.1 and 2.0, and...
Scheduling Computationally Intensive Data Parallel Programs (1997)
Raghu Subramanian, Isaac D. Scherson, Veronica L. M. Reis, Luis Miguel Campos
. We consider the problem of how to run a workload of multiple parallel jobs on a single parallel machine. Jobs are assumed to be data-parallel with large degrees of parallelism, and the machine is...
Orthogonal Interconnection Networks for Massively Parallel Computers. (1997)
This final report is a cumulative summary of our group's research accomplishments under the AFOSR grant number F49620-92-J-O126. Over the past three years, our work has spanned the areas of...
Efficient Techniques for Fast Nested Barrier Synchronization (1996)
Vara Ramakrishnan, Isaac D. Scherson, Raghu Subramanian
Two hardware barrier synchronization schemes are presented which can support deep levels of control nesting in data parallel programs. Hardware barriers are usually an order of magnitude faster than...
An Operating System Framework for Large Parallel Computers (1995)
Isaac D. Scherson, Dinesh Ramanathan, Raghu Subramanian, Vara Ramakrishnan, Veronica L. M. Reis
Little work has been done on operating systems for massively parallel computing. This paper proposes a framework for such an operating system. It is assumed that there are multiple jobs executing on...
An Operating System Framework for Large Parallel Computers (1995)
Isaac D. Scherson, Dinesh Ramanathan, Raghu Subramanian, Vara Ramakrishnan, Veronica L. M. Reis
Little work has been done on operating systems for massively parallel computing. This paper proposes a framework for such an operating system. It is assumed that there are multiple jobs executing on...