(Enter summary)
Abstract: The Mayfly pattern describes an implementation approach to constructing interfaces for efficient data structures. In Nature, the mayfly is a creature well known for its short life span. Similarly, for our purposes, a Mayfly is a temporary object that resides on the stack or only in registers (never in the heap). All of its member functions are typically inlined and it is always passed by value. These characteristics make Mayfly objects ideal for providing lightweight interfaces to efficient... (Update)
Context of citations to this paper: More
...such as this a Mayfly because of its very short lifetime. We discussed the Mayfly as a design pattern for high performance computing in [25]. Additionally, the flexibility within the GGCL is derived exclusively from static polymorphism, not from dynamic polymorphism. As a...
...object such as this a Mayfly because of its very short lifetime. We discuss the Mayfly as a design pattern for high performance computing in [20]. Define a tag for the custom graph representation. struct my graphrep tag fg; template # class stored edge # class graph...
Cited by: More
The Generic Graph Component Library - Lee, Siek, Lumsdaine (1999)
(Correct)
The High Performance Generic Graph Component Library - Lee (1999)
(Correct)
Active bibliography (related documents): More All
0.7: A Modern Framework for Portable High Performance Numerical Linear.. - Siek (1999)
(Correct)
0.3: Policy Adaptors and the Boost Iterator Adaptor Library - Abrahams, Siek
(Correct)
0.3: Active Libraries and Universal Languages - Veldhuizen (2004)
(Correct)
Similar documents based on text: More All
0.5: Implementing Concurrent Scheme for the Mayfly.. - Kessler, Carr.. (1992)
(Correct)
0.5: The Post Office Experience: Designing a Large Asynchronous.. - Davis, Stevens, Coates (1993)
(Correct)
0.4: R2: A Damped Adaptive Router Design - Davis Hodgson Robinson
(Correct)
Related documents from co-citation: More All
2: Graph Template Library (context) - Forster, Pick et al.
2: The Standard Template Library
- Stepanov, Lee - 1995
2: UML Notation Guide (context) - Group - 1997
BibTeX entry: (Update)
J. G. Siek and A. Lumsdaine. Mayfly: A pattern for light-weight generic interfaces. In PLOP99, 1999. Accepted. http://citeseer.ist.psu.edu/siek99mayfly.html More
@misc{ andrew-mayfly,
author = "Jeremy Siek and Andrew Lumsdaine",
title = "Mayfly A Pattern for Lightweight Generic Interfaces",
url = "citeseer.ist.psu.edu/siek99mayfly.html" }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
2157
Design Patterns: Elements of Reusable ObjectOriented Softwar.. (context) - Gamma, Helm et al. - 1994
376
The cache performance and optimizations of blocked algorithm.. (context) - Lam, Rothberg et al. - 1991
292
Advanced Compiler Design and Implementation (context) - Muchnick - 1997
157
Automatically tuned linear algebra software
- Whaley, Dongarra - 1997
67
Expression templates
- Veldhuizen - 1995
41
A quantitative analysis of loop nest locality
- McKinley, Temam - 1996
31
The matrix template library: A generic programming approach ..
- Siek, Lumsdaine - 1998
20
Array design and expression evaluation in pooma ii (context) - Karmesin, Crotinger et al. - 1998
12
The generic graph component library
- Lee, Lumsdaine - 1999
12
be faster than Fortran (context) - Veldhuizen, Jernigan - 1997
11
Graph Theory and Sparse Matrix Computation (context) - George, Gilbert et al. - 1993
10
ISO Programming Language C++ Project (context) - Stepanov, Lee et al. - 1994
9
Professional computing series (context) - Austern, the - 1999
8
Automatic blocking by a compiler (context) - Lam, Wolf - 1991
8
Kuck and Associates C++ User's Guide (context) - Associates
7
Springer-Verlag New York (context) - Skiena, Design - 1998
5
UML Notation Guide (context) - Group - 1997
4
Modern Software Tools in Scientific Computing (context) - Siek, Lumsdaine - 1999
4
Iterative Methods for Sparse Minear System (context) - Saad - 1996
http://www.mpi-sb.mpg.de/LEDA/leda.html
Documents on the same site (http://www.lsc.nd.edu/~jsiek/): More
Concept Checking: Binding Parametric Polymorphism in C++ - Siek, Lumsdaine (2000)
(Correct)
Generic Graph Algorithms for Sparse Matrix Ordering - Lee, Siek, Lumsdaine (1999)
(Correct)
The Generic Graph Component Library - Siek, Lee, Lumsdaine (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC