The High Performance Generic Graph Component Library

نویسنده

  • Lie-Quan Lee
چکیده

by Lie-Quan Lee In this thesis I present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Standard Template Library (STL), the graph algorithms in GGCL do not depend on the particular data structures upon which they operate, meaning a single algorithm can operate on arbitrary concrete representations of graphs. I describe the principal abstractions comprising the GGCL, the algorithms and data structures that it provides, and provide examples that demonstrate the use of GGCL to implement some common graph algorithms. Performance results are presented which demonstrate that the use of novel lightweight implementation techniques and static polymorphism in GGCL results in code which is significantly more efficient than similar libraries written using the objectoriented paradigm. To my father, my mother in memoriam, and my wife Yun

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generic Graph Algorithms for Sparse Matrix Ordering

Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical framework, for reasons of performance the corresponding implementations are typically realized with programming languages devoid of language features necessary to explicitly represent graph abstractions. Recently, generic ...

متن کامل

The Matrix Template Library: generic components for high-performance scientific computing

COMPUTING IN SCIENCE & ENGINEERING tal paradigm underlying the STL, was an important and powerful new software development methodology—and this has been borne out by the tremendous success of the STL for generalpurpose programming. Not so obvious then, however, was how (or even if) generic programming could apply to other problem domains. To investigate the merit of this approach for scientific...

متن کامل

The Parallel BGL: A Generic Library for Distributed Graph Computations

This paper presents the Parallel BGL, a generic C++ library for distributed graph computation. Like the sequential Boost Graph Library (BGL) upon which it is based, the Parallel BGL applies the paradigm of generic programming to the domain of graph computations. Emphasizing efficient generic algorithms and the use of concepts to specify the requirements on type parameters, the Parallel BGL also...

متن کامل

Generic Programming for High Performance Numerical Linear Algebra

We present a generic programming methodology for expressing data structures and algorithms for high-performance numerical linear algebra. As with the Standard Template Library [14], our approach explicitly separates algorithms from data structures, allowing a single set of numerical routines to operate with a wide variety of matrix types, including sparse, dense, and banded. Through the use of ...

متن کامل

Microkernel System as Basis for System Library Based on Generic Components

In this paper we present an idea of system library, based on generic components within microkernel system in the area of embedded systems. The paper describes basic Exokernel structure and functionality with focus on Exokernel ability to separate high level abstraction from kernel itself. Equally class hierarchy based Choices framework is briefly described. A Choices divides parts of operating ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999