Investigation of the Page Fault Performance of Cedar

This reports contains the performance results collected during an investigation of the different types of page faults on Cedar. Along with the performance results, a description is provided of some of the different page fault types. 1 Introduction The hierarchical memory system architecture of Cedar required the development of a complex virtual memory system. The performance implications of this virtual memory system are hard to understand when examining the performance of an application program. Therefore, an investigationwas performed which only looked at the virtual memory system. This reports provides the results of the investigation of the virtual memory system. Section 2 will provide an overview of Cedar architecture and the Xylem operating system. Section 3 will present a description of several types of page faults. The performance results for the page faults types will be presented in Section 4. Some conclusions will be presented in Section 5. 2 Overview of Cedar and Xylem Th..

Techniques for the Interactive Development of Numerical Linear Algebra Libraries for Scientific Computation

158 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.The development of high-performance numerical algorithms and their effective use in application codes is an iterative process involving the refinement of the algorithms and their implementations that continues during the lifetime of the algorithm. Knowledge and expertise from the areas of numerical analysis, computer software, compilers, machine architecture, and applications are required during the development. To improve this process, the FALCON environment was developed to combine the analysis techniques from restructuring compilers with the algebraic techniques from numerical analysis. In this thesis, interactive techniques that were developed to extend the FALCON environment are described. These techniques allow the developer to improve the analysis of the algorithm, to restructure the algorithm using transformation patterns, to utilize additional information about structures within the data, and to control the generation of the target code. The experimental results show that the codes generated by the interactive techniques have better performance than those generated automatically. In addition, the environment was extended to support the generation of C++ code. When the C++ code generated by FALCON is compared to the code generated by other MATLAB translators, the C++ code is typically faster. However, when compared against the Fortran 90 code generated by FALCON, the C++ code is usually slower.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD

Large Grain Parallel Sparse System Solver

CONTENTS 1 INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.1 The Problem -- Solving Large Sparse Systems : : : : : : : : : : : : : : : : : : : : 1 1.2 The Cedar Architecture : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.3 Overview of Thesis : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2 MOTIVATION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1 Motivation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.2 Initial Research : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 3 OVERVIEW : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 3.1 Hybrid Ordering H* : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :

Practical Issues Related to Developing Object-Oriented Numerical Libraries

In this paper a tool is presented for the development of numerical libraries for an objectoriented environment. The development of libraries has become more complicated as libraries have become larger and the subroutines have become more complex. In the object--oriented environment this development is further complicated by the object interface which usually resides between the application and the numerical subroutines. The tools being presented here are meant to help the development of high--performance libraries. 1 Introduction In this paper we present a tool for the development of numerical libraries for an object--oriented environment. We believe that library designers need tools such as these in order to develop, and maintain, increasingly complex numerical libraries for high performance systems, including both sequential and parallel architectures. Without such tools it will be impossible for the library designer to be responsive to the requests of the application programmers fo..

A Large-Grain Parallel Sparse System Solver

. The efficiency of solving sparse linear systems on parallel processors and more complex multicluster architectures such as Cedar is greatly enhanced if relatively large grain computational tasks can be assigned to each cluster or processor. The ordering of a system into a bordered block upper triangular form facilitates a reasonable large-grain partitioning. A new algorithm which produces this form for unsymmetric sparse linear systems is considered and the associated factorization algorithm is presented. Computational results are presented for the Cedar multiprocessor. Several techniques have been proposed to solve large sparse systems of linear equations on parallel processors. A key task which determines the effectiveness of these techniques is the identification and exploitation of the computational granularity appropriate for the target multiprocessor architecture. Many algorithms assume special properties such as symmetric positive definiteness or exploit knowledge of the appl..

MCSPARSE: A Parallel Sparse Unsymmetric Linear System Solver

. In this paper, an unsymmetric sparse linear system solver based on the exploitation of multilevel parallelism is proposed. One of the main issues addressed is the application of tearing techniques to enhance large grain parallelism in a manner that maintains reasonable stability. This is accomplished by a combination of a novel reordering technique (H*) and pivoting strategy. The large grain parallelism exposed by the reordering is combined with medium (various parallel row updates strategies) and fine grain (vectorization) parallelism to allow adaptation to a wide range of multiprocessor architectures. Experimental results are presented which show the effectiveness of the reordering, as well as the stability and efficiency of the solver. 1. Introduction. Several techniques have been proposed to solve large sparse systems of linear equations on parallel processors. A key task which determines the effectiveness of these techniques is the identification and exploitation of the computa..