Articles in journals or book chapters (9)
  1. Jeffrey M. Squyres. Definitions and Fundamentals -- The Message Passing Interface (MPI). ClusterWorld Magazine, MPI Mechanic Column, 1(1):26--29, December 2003.
    Keywords: MPI.
    @Article{squyres03:_defin_fundam,
    author = {Jeffrey M. Squyres},
    title = {Definitions and Fundamentals -- The Message Passing Interface ({MPI})},
    journal = {ClusterWorld Magazine, {MPI} Mechanic Column},
    pages = {26--29},
    year = 2003,
    volume = 1,
    number = 1,
    month = {December},
    url = {http://cw.squyres.com/},
    keywords = {MPI} }


  2. M. Swany and R. Wolski. Network Scheduling for Computational Grid Environments. Workshop on Adaptive Grid Middleware 2003 (in association with PACT03), September 2003.
    @article{swany_article_grid_middleware,
    Author = {M. Swany and R. Wolski},
    Date-Added = {2016-06-10 14:43:39 +0000},
    Date-Modified = {2016-06-10 14:46:48 +0000},
    Journal = {Workshop on Adaptive Grid Middleware 2003 (in association with PACT03)},
    Month = {September},
    Title = {Network Scheduling for Computational Grid Environments},
    Year = {2003} }


  3. J. Järvi, J. Willcock, H. Hinnant, and A. Lumsdaine. Function Overloading Based on Arbitrary Properties of Types. C/C++ Users Journal, 21(6):25--32, June 2003.
    Note: Magazine.
    @article{jarvi:03:cuj_arbitrary_overloading,
    author = {J. J\"arvi and J. Willcock and H. Hinnant and A. Lumsdaine},
    title = "Function Overloading Based on Arbitrary Properties of Types",
    journal = "C/C++ Users Journal",
    year = 2003,
    month = jun,
    pages = "25--32",
    volume = "21",
    number = 6,
    note = {Magazine} }


  4. B. Lowekamp, B. Tierney, Les Cottrell, R. Hughes-Jones, T. Kielmann, and M. Swany. Enabling Network Measurement Portability Through a Hierarchy of Characteristics. 4th International Workshop on Grid Computing (Grid2003), May 2003.
    @article{swany_article_grid2003,
    Author = {B. Lowekamp and B. Tierney and Les Cottrell and R. Hughes-Jones and T. Kielmann and M. Swany},
    Date-Added = {2016-06-10 14:54:19 +0000},
    Date-Modified = {2016-06-10 14:58:46 +0000},
    Journal = {4th International Workshop on Grid Computing (Grid2003)},
    Month = {May},
    Title = {Enabling Network Measurement Portability Through a Hierarchy of Characteristics},
    Year = {2003} }


  5. Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. Siek, and Lynn Winebarger. Improving the Lazy Krivine Machine. Higher-Order and Symbolic Computation, 2003.
    Note: Accepted for publication.
    @Article{friedman03:_improve_krivine,
    author = {Daniel P. Friedman and Abdulaziz Ghuloum and Jeremy G. Siek and Lynn Winebarger},
    title = {Improving the Lazy Krivine Machine},
    journal = {Higher-Order and Symbolic Computation},
    year = 2003,
    note = {accepted for publication} }


  6. Douglas Gregor, Sibylle Schupp, and David R. Musser. Design Patterns for Library Optimization. Scientific Programming, 11(4):309--320, 2003.
    @Article{GSM03,
    author = {Douglas Gregor and Sibylle Schupp and David R. Musser},
    title = {Design Patterns for Library Optimization},
    journal = {Scientific Programming},
    pages = {309--320},
    year = {2003},
    volume = 11,
    number = 4 }


  7. J. Järvi, G. Powell, and A. Lumsdaine. The Lambda Library: unnamed functions in C++. Software---Practice and Experience, 33:259--291, 2003.
    @article{jarvi:03:spe_lambda,
    author = {J. J\"arvi and G. Powell and A. Lumsdaine},
    title = {{The Lambda Library: unnamed functions in C++}},
    journal = "Software---Practice and Experience",
    year = 2003,
    pages = "259--291",
    volume = 33,
    issue = 3,
    }


  8. Andrew Lumsdaine and Deyun Wu. Krylov-Subspace Acceleration of Waveform Relaxation. SIAM Journal on Numerical Analysis, 41(1):90-111, 2003.
    @Article{ lumsdaine03:_convolution,
    author = "Andrew Lumsdaine and Deyun Wu",
    title = "Krylov-Subspace Acceleration of Waveform Relaxation",
    journal = "SIAM Journal on Numerical Analysis",
    volume = 41,
    number = 1,
    pages = "90-111",
    year = 2003 }


  9. Irina Virtanen, Eeva Ekholm, Tero Aittokallio, Jarno Tähtinen, Jussi Salmi, Jaakko Järvi, Päivi Polo-Kantola, and Olli Polo. State of vigilance, oestrogen replacement therapy, and libid profile as modifiers of nocturnal movement-induced heart rate responces. Clinical Physiology and Functional Imaging, 23(5):293--299, 2003.
    @article{virtanen:03:nocturnal,
    author = {Irina Virtanen and Eeva Ekholm and Tero Aittokallio and Jarno T\"ahtinen and Jussi Salmi and Jaakko J\"arvi and P\"aivi Polo-Kantola and Olli Polo},
    title = "State of vigilance, oestrogen replacement therapy, and libid profile as modifiers of nocturnal movement-induced heart rate responces",
    journal = {Clinical Physiology and Functional Imaging},
    volume = 23,
    number = 5,
    pages = "293--299",
    year = 2003,
    }


Conference articles (17)
  1. Ronald Garcia, Jaakko Järvi, Andrew Lumsdaine, Jeremy G. Siek, and Jeremiah Willcock. A Comparative Study of Language Support for Generic Programming. In Proceedings of the 2003 ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (OOPSLA'03), October 2003.
    @InProceedings{comparing_generic_programming03,
    author = {Ronald Garcia and Jaakko J\"arvi and Andrew Lumsdaine and Jeremy G. Siek and Jeremiah Willcock},
    title = {A Comparative Study of Language Support for Generic Programming},
    booktitle = {Proceedings of the 2003 ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (OOPSLA'03)},
    year = 2003,
    month = oct,
    conflocation = "Anaheim, CA",
    url = "http://doi.acm.org/10.1145/949305.949317",
    thanks = {Lilly Endowment, NSF ACI-0219884 and NSF EIA-0131354} }


  2. Jaakko Järvi, Andrew Lumsdaine, Jeremy Siek, and Jeremiah Willcock. An Analysis of Constrained Polymorphism for Generic Programming. In Kei Davis and Jörg Striegnitz, editors, Multiparadigm Programming 2003: Proceedings of the MPOOL Workshop at OOPSLA'03, John von Neumann Institute of Computing series, Anaheim, CA, pages 87--107, October 2003.
    @inproceedings{constrained_polymorphism:mpool03,
    Address = {Anaheim, CA},
    Author = {J{\"{a}}rvi, Jaakko and Lumsdaine, Andrew and Siek, Jeremy and Willcock, Jeremiah},
    Booktitle = {Multiparadigm Programming 2003: Proceedings of the MPOOL Workshop at OOPSLA'03},
    Editor = {Davis, Kei and Striegnitz, J\"{o}rg},
    Month = oct,
    Pages = {87--107},
    Series = {John von Neumann Institute of Computing series},
    Title = {{An Analysis of Constrained Polymorphism for Generic Programming}},
    Year = {2003} }


  3. Jaakko Järvi, Andrew Lumsdaine, Jeremy Siek, and Jeremiah Willcock. An Analysis of Constrained Polymorphism for Generic Programming. In Kei Davis and Jörg Striegnitz, editors, Multiparadigm Programming 2003: Proceedings of the MPOOL Workshop at OOPSLA'03, John von Neumann Institute of Computing series, Anaheim, CA, pages 87--107, October 2003.
    @InProceedings{constrained_polymorphism:mpool03,
    author = {Jaakko J{\"a}rvi and Andrew Lumsdaine and Jeremy Siek and Jeremiah Willcock},
    title = {An Analysis of Constrained Polymorphism for Generic Programming},
    booktitle = {Multiparadigm Programming 2003: Proceedings of the MPOOL Workshop at OOPSLA'03},
    year = 2003,
    editor = {Kei Davis and J\"org Striegnitz},
    address = {Anaheim, CA},
    month = oct,
    series = {John von Neumann Institute of Computing series},
    pages = {87--107},
    url = "http://www.osl.iu.edu/~jajarvi/publications/papers/mpool03.pdf",
    thanks = "NSF EIA-0131354 and ACI-0219884, Lilly Endowment, DOE HPCSF",
    }


  4. S. Sankaran, J. Squyres, B.Barett, A. Lumsdaine, J. Duell, P. Hargrove, and E. Roman. The LAM/MPI Checkpoint/Restart Framework: System-Initiated Checkpointing. In In LACSI Symposium, October 2003.
    @InProceedings{lumsdaine03:_LAM,
    author = {S. Sankaran and J. Squyres and B.Barett and A. Lumsdaine and J. Duell and P. Hargrove and E. Roman},
    title = {The LAM/MPI Checkpoint/Restart Framework: System-Initiated Checkpointing},
    booktitle = {In LACSI Symposium},
    month = {October},
    year = 2003 }


  5. Jeffrey M. Squyres and Andrew Lumsdaine. A Component Architecture for LAM/MPI. In Proceedings, Euro PVM/MPI, October 2003.
    @InProceedings{squyres03:_compon_archit_lam_mpi,
    thanks = {Lilly Endowment and NSF 0116050},
    author = {Jeffrey M.\ Squyres and Andrew Lumsdaine},
    title = {A Component Architecture for {LAM/MPI}},
    booktitle = {Proceedings, Euro PVM/MPI},
    year = 2003,
    month = {October} }


  6. Jaakko Järvi, Jeremiah Willcock, and Andrew Lumsdaine. Concept-Controlled Polymorphism. In Frank Pfennig and Yannis Smaragdakis, editors, Generative Programming and Component Engineering, volume 2830 of LNCS, pages 228--244, September 2003. Springer Verlag.
    @InProceedings{jarvi03:_concep_contr_polym,
    author = {Jaakko J{\"a}rvi and Jeremiah Willcock and Andrew Lumsdaine},
    title = {Concept-Controlled Polymorphism},
    booktitle = {Generative Programming and Component Engineering},
    pages = {228--244},
    year = 2003,
    editor = {Frank Pfennig and Yannis Smaragdakis},
    volume = 2830,
    series = {LNCS},
    month = sep,
    publisher = {Springer Verlag},
    conflocation = "Erfurt, Germany",
    thanks = "NSF EIA-0131354 and ACI-0219884, Lilly Endowment" }


  7. Uwe Naumann and Peter Gottschling. Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation. In 2nd Symp. on Stochastic Algorithms: Foundations and Applications SAGA03, Hatfield, UK, September 2003.
    @INPROCEEDINGS{pg_saga03,
    author = {Uwe Naumann and Peter Gottschling},
    title = {Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation},
    booktitle = {2nd Symp. on Stochastic Algorithms: Foundations and Applications SAGA03, Hatfield, UK},
    year = {2003},
    month = {September} }


  8. Ralf Müller, Martin Gaber, and Peter Gottschling. Water Release and Crystallization of Glass Powders. In 7th Intern. Symposium on Crystallisation in Glasses and Liquids, Sheffield, UK, July 2003.
    @INPROCEEDINGS{pg_sheffield,
    author = {Ralf M{\"u}ller and Martin Gaber and Peter Gottschling},
    title = {Water Release and Crystallization of Glass Powders},
    booktitle = {7th Intern. Symposium on Crystallisation in Glasses and Liquids, Sheffield, UK},
    year = {2003},
    month = {July} }


  9. John Mugler, Thomas Naughton, Stephen L. Scott, Brian Barrett, Andrew Lumsdaine, Jeffrey M. Squyres, Beno�t des Ligneris, Francis Giraldeau, and Chokchai Leangsuksun. OSCAR Clusters. In Proceedings of the Ottawa Linux Symposium (OLS'03), Ottawa, Canada, July # 23-26, 2003.
    Keywords: OSCAR, Thin-OSCAR, HA-OSCAR, cluster.
    @InProceedings{oscar:ols03,
    thanks = {Lilly Endowment},
    author = "John Mugler and Thomas Naughton and Stephen L. Scott and Brian Barrett and Andrew Lumsdaine and Jeffrey M.\ Squyres and {Beno�t des Ligneris} and {Francis Giraldeau} and Chokchai Leangsuksun",
    title = "{OSCAR Clusters}",
    booktitle = "Proceedings of the Ottawa Linux Symposium (OLS'03)",
    year = "2003",
    month = July # "~23-26, ",
    address = "Ottawa, Canada",
    url = {http://www.linuxsymposium.org/},
    keywords = "OSCAR, Thin-OSCAR, HA-OSCAR, cluster",
    bibdate = "Mon Jul 14 11:21:43 EDT 2003" }


  10. M. Zalewski and S. Schupp. A Polymorphic Radix-n Framework for Fast Fourier Transforms. In M. Broy and A. V Zamulin, editors, Proc. 5th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics, volume 2890 of LNCS, pages 30―37, July 2003. Springer.
    @inproceedings{zalewski_polymorphic_2003,
    series = {{LNCS}},
    title = {A Polymorphic Radix-$n$ Framework for Fast Fourier Transforms},
    volume = 2890,
    doi = {http://dx.doi.org/10.1007/b94823},
    booktitle = {Proc. 5th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics},
    publisher = {Springer},
    author = {M. Zalewski and S. Schupp},
    editor = {M. Broy and A. V Zamulin},
    month = jul,
    year = 2003,
    pages = {30―37} }


  11. Jeffrey M. Squyres and Andrew Lumsdaine. A Component Architecture for LAM/MPI. In Proceedings ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, USA, June 2003.
    Note: Short Talk on Emerging Research.
    @InProceedings{squyres03:_compon_archit_lam_mpi,
    thanks = {Lilly Endowment and NSF 0116050},
    author = {Jeffrey M. Squyres and Andrew Lumsdaine},
    title = {A Component Architecture for {LAM/MPI}},
    booktitle = {Proceedings ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
    year = 2003,
    address = {San Diego, CA, USA},
    month = {June},
    note = {Short Talk on Emerging Research} }


  12. Brian Barrett, Jeff Squyres, and Andrew Lumsdaine. Integration of the LAM/MPI environment and the PBS scheduling system. In Proceedings, 17th Annual International Symposium on High Performance Computing Systems and Applications, Quebec, Canada, May 2003.
    Keywords: LAM/MPI, LAM, PBS, MPI, TM, Message Passing Interface, scheduling, batch scheduling, high performance computing.
    @InProceedings{barrett03:_integ_lam_mpi_pbs,
    author = {Brian Barrett and Jeff Squyres and Andrew Lumsdaine},
    title = {Integration of the {LAM/MPI} environment and the {PBS} scheduling system},
    keywords = {LAM/MPI, LAM, PBS, MPI, TM, Message Passing Interface, scheduling, batch scheduling, high performance computing},
    booktitle = {Proceedings, 17th Annual International Symposium on High Performance Computing Systems and Applications},
    year = 2003,
    address = {Quebec, Canada},
    month = {May} }


  13. Peter Gottschling, Martin Gaber, and Ralf Müller. Numerical Simulation of Degassing Processes from Glass Powders (in German). In 77th Conference of German Society of Glass Technology, Leipzig, May 2003.
    @INPROCEEDINGS{pg_leipzig,
    author = {Peter Gottschling and Martin Gaber and Ralf M{\"u}ller},
    title = {Numerical Simulation of Degassing Processes from Glass Powders (in German)},
    booktitle = {77th Conference of German Society of Glass Technology, Leipzig},
    year = {2003},
    month = {May} }


  14. Prabhanjan Kambadur, Raj Mutharasan, and Sangli Pranesh Srinivas. Adaptation of a Spot Fluorometer for Lifetime Applications. In Proceedings of Association For Research in Vision and Opthalmology (ARVO), Fort Lauderdale, USA, May 2003.
    @InProceedings{kambadur03:spot_fluorometer,
    author = {Prabhanjan Kambadur and Raj Mutharasan and Sangli Pranesh Srinivas},
    title = {Adaptation of a Spot Fluorometer for Lifetime Applications},
    booktitle = {Proceedings of Association For Research in Vision and Opthalmology (ARVO)},
    year = 2003,
    address = {Fort Lauderdale, USA},
    month = {May} }


  15. Raj Mutharasan, Prabhanjan Kambadur, and Sangli Pranesh Srinivas. Calculation of Bioavailability Using Distributed Parameter Models of Trans-Corneal Transport. In Proceedings of Association For Research in Vision and Opthalmology (ARVO), Fort Lauderdale, USA, May 2003.
    @InProceedings{kambadur03:bioavailability,
    author = {Raj Mutharasan and Prabhanjan Kambadur and Sangli Pranesh Srinivas},
    title = {Calculation of Bioavailability Using Distributed Parameter Models of Trans-Corneal Transport},
    booktitle = {Proceedings of Association For Research in Vision and Opthalmology (ARVO)},
    year = 2003,
    address = {Fort Lauderdale, USA},
    month = {May} }


  16. Lie-Quan Lee and Andrew Lumsdaine. The Generic Message Passing Framework. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), pages 53, April 2003.
    @InProceedings{lee03:_gmp_ipdps03,
    author = {Lie-Quan Lee and Andrew Lumsdaine},
    title = {The Generic Message Passing Framework},
    booktitle = {Proceedings of the {International Parallel and Distributed Processing Symposium (IPDPS)}},
    pages = 53,
    year = 2003,
    month = {April},
    pdf = {http://csdl.computer.org/dl/proceedings/ipdps/2003/1926/00/19260053b.pdf},
    thanks = {NSF ACI-9982205} }


  17. Andreas Albrecht, Peter Gottschling, and Uwe Naumann. Markowitz-type heuristics for computing Jacobian matrices efficiently. In Internat. Conference on Computational Science, St. Petersburg, number 2658 of LNCS, 2003.
    @INPROCEEDINGS{pg_iccs,
    author = {Andreas Albrecht and Peter Gottschling and Uwe Naumann},
    title = {Markowitz-type heuristics for computing Jacobian matrices efficiently},
    booktitle = {Internat. Conference on Computational Science, St. Petersburg},
    year = {2003},
    number = {2658},
    series = {LNCS} }


Internal reports (15)
  1. Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. Siek, and Lynn Winebarger. Improving the Lazy Krivine Machine. Technical report 581, Indiana University, November 2003.
    Note: To appear in the journal, Higher Order and Symbolic Computation.
    Annotation: Krivine presents the K machine, which produces weak head normal form results. Sestoft introduces several call-by-need variants of the K machine that implement result sharing via pushing update markers on the stack in a way similar to the TIM and the STG machine. When a sequence of consecutive markers appears on the stack, all but the first cause redundant updates. Improvements related to these sequences have dealt with either the consumption of the markers or the removal of the markers once they appear. Here we present an improvement that eliminates the production of marker sequences of length greater than one. This improvement results in the C machine, a more space and time efficient variant of K. We then apply the classic optimization of short-circuiting operand variable dereferences to create the call-by-need S machine. Finally, we combine the two improvements in the CS machine. On our benchmarks this machine uses half the stack space, performs one quarter as many updates, and executes between 27 0.000000aster and 17lower than our L variant of Sestoft's lazy Krivine machine. More interesting is that on one benchmark L, S, and C consume unbounded space, but CS consumes constant space. Our comparisons to Sestoft's Mark 2 machine are not exact, however, since we restrict ourselves to unpreprocessed closed lambda terms. Our variant of his machine does no environment trimming, conversion to deBruijn-style variable access, and does not provide basic constants, data type constructors, or the recursive let. (The Y combinator is used instead.)

    @TechReport{friedman03:_improve_krivine_tr,
    author = {Daniel P. Friedman and Abdulaziz Ghuloum and Jeremy G. Siek and Lynn Winebarger },
    title = {Improving the Lazy Krivine Machine},
    institution = {Indiana University},
    year = 2003,
    number = 581,
    month = {November},
    note = {To appear in the journal, Higher Order and Symbolic Computation},
    url = {http://www.cs.indiana.edu/cgi-bin/techreports/TRNNN.cgi?trnum=TR581},
    annote = {Krivine presents the K machine, which produces weak head normal form results. Sestoft introduces several call-by-need variants of the K machine that implement result sharing via pushing update markers on the stack in a way similar to the TIM and the STG machine. When a sequence of consecutive markers appears on the stack, all but the first cause redundant updates. Improvements related to these sequences have dealt with either the consumption of the markers or the removal of the markers once they appear. Here we present an improvement that eliminates the production of marker sequences of length greater than one. This improvement results in the C machine, a more space and time efficient variant of K. We then apply the classic optimization of short-circuiting operand variable dereferences to create the call-by-need S machine. Finally, we combine the two improvements in the CS machine. On our benchmarks this machine uses half the stack space, performs one quarter as many updates, and executes between 27 0.000000aster and 17lower than our L variant of Sestoft's lazy Krivine machine. More interesting is that on one benchmark L, S, and C consume unbounded space, but CS consumes constant space. Our comparisons to Sestoft's Mark 2 machine are not exact, however, since we restrict ourselves to unpreprocessed closed lambda terms. Our variant of his machine does no environment trimming, conversion to deBruijn-style variable access, and does not provide basic constants, data type constructors, or the recursive let. (The Y combinator is used instead.)} }


  2. Douglas Gregor and Sibylle Schupp. Retaining Path-Sensitive Relations across Control-Flow Merges. Technical report 03-15, Rensselaer Polytechnic Institute, November 2003.
    @TechReport{GrSc03,
    author = {Douglas Gregor and Sibylle Schupp},
    title = {Retaining Path-Sensitive Relations across Control-Flow Merges},
    institution = {Rensselaer Polytechnic Institute},
    year = 2003,
    number = {03-15},
    month = {November} }


  3. J. Järvi and B. Stroustrup. Mechanisms for querying types of expressions: Decltype and auto revisited. Technical report N1527=03-0110, ISO/IEC JTC 1, Information technology, Subcommittee SC 22, Programming Language C++, September 2003.
    @techreport{jarvi:03:std_decltype_revisited,
    author = {J. J\"arvi and B. Stroustrup},
    title = "Mechanisms for querying types of expressions: Decltype and auto revisited",
    institution = "ISO/IEC JTC 1, Information technology, Subcommittee SC 22, Programming Language {C++}",
    number = "N1527=03-0110",
    year = 2003,
    month = sep,
    url = "http://www.osl.iu.edu/~jajarvi/publications/papers/decltype_revisited_n1527.pdf",
    }


  4. Todd L. Veldhuizen and Jeremy Siek. Combining Optimizations, Combining Theories. Technical report 582, Indiana University, May 2003.
    Annotation: We consider the problem of how best to combine optimizations in imperative compilers. It is known that combined optimizations (or ``super-analyses'') can be strictly better than iterating separate improvement passes. We propose an explanation of why this is so by drawing connections between program analysis and the algebraic and coalgebraic views of programs and processes. We argue that ``optimistic'' analyses decide coinductively-defined relations and are based on bisimilarity. We relate combining program improvements to the problem of deciding combinations of theories. Iterating program improvements is similar to the Nelson-Oppen method of deciding combined theories: in Nelson-Oppen decision procedures communicate equalities, and iterated improvement passes implicitly communicate equalities via term replacements. To decide combined theories of bisimilarity, some ``co-Nelson-Oppen'' procedure is needed that propagates \e mph{inequalities} amongst decision procedures. Hence, iterating optimistic analyses fails to be effective because inequalities cannot be communicated by semantics-preserving rewrites. Superanalysis is conjectured to overcome this failing by behaving like a ``co-Nelson-Oppen'' decision procedure.

    @TechReport{veldhuizen03:_comb_opt_thy,
    author = {Todd L. Veldhuizen and Jeremy Siek},
    title = {Combining Optimizations, Combining Theories},
    institution = {Indiana University},
    year = 2003,
    number = 582,
    month = {May},
    url = {http://www.cs.indiana.edu/cgi-bin/techreports/TRNNN.cgi?trnum=TR582},
    annote = {We consider the problem of how best to combine optimizations in imperative compilers. It is known that combined optimizations (or ``super-analyses'') can be strictly better than iterating separate improvement passes. We propose an explanation of why this is so by drawing connections between program analysis and the algebraic and coalgebraic views of programs and processes. We argue that ``optimistic'' analyses decide coinductively-defined relations and are based on bisimilarity. We relate combining program improvements to the problem of deciding combinations of theories. Iterating program improvements is similar to the Nelson-Oppen method of deciding combined theories: in Nelson-Oppen decision procedures communicate equalities, and iterated improvement passes implicitly communicate equalities via term replacements. To decide combined theories of bisimilarity, some ``co-Nelson-Oppen'' procedure is needed that propagates \emph{inequalities} amongst decision procedures. Hence, iterating optimistic analyses fails to be effective because inequalities cannot be communicated by semantics-preserving rewrites. Superanalysis is conjectured to overcome this failing by behaving like a ``co-Nelson-Oppen'' decision procedure.} }


  5. David Abrahams, Jeremy Siek, and Thomas Witt. Iterator Facade and Adaptor. Technical report N1476=03-0059, ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, Programming Language C++, 2003.
    @TechReport{abrahams03:_iterat_facad_adapt,
    author = {David Abrahams and Jeremy Siek and Thomas Witt},
    title = {Iterator Facade and Adaptor},
    institution = {ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, Programming Language {C++}},
    year = 2003,
    url = "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1476.html",
    number = {N1476=03-0059} }


  6. David Abrahams, Jeremy Siek, and Thomas Witt. New Iterator Concepts. Technical report N1477=03-0060, ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, Programming Language C++, 2003.
    @TechReport{abrahams03:_new_iterator_concepts,
    author = {David Abrahams and Jeremy Siek and Thomas Witt},
    title = {New Iterator Concepts},
    institution = {ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, Programming Language {C++}},
    year = 2003,
    number = {N1477=03-0060},
    url = "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1477.html",
    }


  7. Peter Dimov, Douglas Gregor, J. Järvi, and Gary Powell. A proposal to add an enhanced binder to the library technical report. Technical report N1455=03-0038, ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, : Programming Language C++, 2003.
    @TechReport{dimov03:_binder,
    author = {Peter Dimov and Douglas Gregor and J. J\"arvi and Gary Powell},
    title = {A proposal to add an enhanced binder to the library technical report},
    institution = {ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, : Programming Language {C++}},
    year = 2003,
    number = {N1455=03-0038},
    url = "http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1455.htm" }


  8. Douglas Gregor, Gary Powell, and J. Järvi. Typesafe variable-length function and template argument lists. Technical report N1483=03-0066, ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, : Programming Language C++, 2003.
    @TechReport{gregor03:_typesafe,
    author = {Douglas Gregor and Gary Powell and J. J\"arvi},
    title = {Typesafe variable-length function and template argument lists},
    institution = {ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, : Programming Language {C++}},
    year = 2003,
    number = {N1483=03-0066},
    url = "http://www.osl.iu.edu/~jajarvi/publications/papers/vararg_templates_n1483.pdf",
    }


  9. J. Järvi, Bjarne Stroustrup, Douglas Gregor, and Jeremy Siek. Decltype and Auto. Technical report N1478=03-0061, ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, : Programming Language C++, 2003.
    @TechReport{jaervi03:_declt_auto,
    author = {J. J\"arvi and Bjarne Stroustrup and Douglas Gregor and Jeremy Siek},
    title = {Decltype and Auto},
    institution = {ISO/IEC JTC 1, Information Technology, Subcommittee SC 22, : Programming Language {C++}},
    year = 2003,
    number = {N1478=03-0061},
    url = "http://www.osl.iu.edu/~jajarvi/publications/papers/decltype_n1478.pdf",
    }


  10. Andrew Lumsdaine. OSL 2003 Bibliography. Technical report OSL-BIB-03-01, Open Systems Lab, Bloomington, IN, USA, January 2003.
    @TechReport{lums03:_allbib,
    author = {Andrew Lumsdaine},
    title = {OSL 2003 Bibliography},
    institution = {Open Systems Lab},
    year = 2003,
    number = {OSL-BIB-03-01},
    address = {Bloomington, IN, USA},
    month = {January} }


  11. Sriram Sankaran, Jeffrey M. Squyres, Brian Barrett, and Andrew Lumsdaine. Checkpoint-Restart Support System Services Interface (SSI) Modules for LAM/MPI. Technical Report TR578, Indiana University, Computer Science Department, 2003.
    @TechReport{sankaran03:_check_restar_suppor_system_servic,
    thanks = {Lilly Endowment and NSF 0116050 and LBL grant},
    type = {Technical Report},
    number = {TR578},
    institution = {Indiana University, Computer Science Department},
    title = {Checkpoint-Restart Support System Services Interface ({SSI}) Modules for {LAM/MPI}},
    year = 2003,
    author = {Sriram Sankaran and Jeffrey M.\ Squyres and Brian Barrett and Andrew Lumsdaine} }


  12. Jeffrey M. Squyres, Brian Barrett, and Andrew Lumsdaine. MPI Collective Operations System Services Interface (SSI) Modules for LAM/MPI. Technical Report TR577, Indiana University, Computer Science Department, 2003.
    @TechReport{squyres03:_mpi_collec_operat_system_servic,
    thanks = {Lilly Endowment and NSF 0116050},
    type = {Technical Report},
    number = {TR577},
    institution = {Indiana University, Computer Science Department},
    title = {{MPI} Collective Operations System Services Interface ({SSI}) Modules for {LAM/MPI}},
    year = 2003,
    author = {Jeffrey M.\ Squyres and Brian Barrett and Andrew Lumsdaine} }


  13. Jeffrey M. Squyres, Brian Barrett, and Andrew Lumsdaine. Request Progression Interface (RPI) System Services Interface (SSI) Modules for LAM/MPI. Technical Report TR579, Indiana University, Computer Science Department, 2003.
    @TechReport{squyres03:_reques_progr_inter_rpi_system,
    thanks = {Lilly Endowment and NSF 0116050},
    type = {Technical Report},
    number = {TR579},
    institution = {Indiana University, Computer Science Department},
    title = {Request Progression Interface ({RPI}) System Services Interface ({SSI}) Modules for {LAM/MPI}},
    year = 2003,
    author = {Jeffrey M.\ Squyres and Brian Barrett and Andrew Lumsdaine} }


  14. Jeffrey M. Squyres, Brian Barrett, and Andrew Lumsdaine. The System Services Interface (SSI) to LAM/MPI. Technical Report TR575, Indiana University, Computer Science Department, 2003.
    @TechReport{squyres03:_system_servic_inter_ssi_lam_mpi,
    thanks = {Lilly Endowment and NSF 0116050},
    type = {Technical Report},
    number = {TR575},
    institution = {Indiana University, Computer Science Department},
    title = {The System Services Interface ({SSI}) to {LAM/MPI}},
    year = 2003,
    author = {Jeffrey M.\ Squyres and Brian Barrett and Andrew Lumsdaine},
    }


  15. Jeffrey M. Squyres, Brian Barrett, and Andrew Lumsdaine. Boot System Services Interface (SSI) Modules for LAM/MPI. Technical Report TR576, Indiana University, Computer Science Department, 2003.
    @TechReport{squyres03:_boot_system_servic_inter_ssi,
    thanks = {Lilly Endowment and NSF 0116050},
    type = {Technical Report},
    number = {TR576},
    institution = {Indiana University, Computer Science Department},
    title = {Boot System Services Interface ({SSI}) Modules for {LAM/MPI}},
    year = 2003,
    author = {Jeffrey M.\ Squyres and Brian Barrett and Andrew Lumsdaine} }


Posters and Presentations (1)
  1. Jeffrey M. Squyres and Andrew Lumsdaine. The Component Architecture of LAM/MPI (Poster), June 2003.
    @Misc{squyres03:_compon_archit_lam_mpi_poster,
    thanks = {Lilly Endowment and NSF 0116050},
    author = {Jeffrey M.\ Squyres and Andrew Lumsdaine},
    title = {The Component Architecture of {LAM/MPI} (Poster)},
    booktitle = {Proceedings ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
    year = 2003,
    address = {San Diego, CA, USA},
    month = {June} }



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.




Last modified: Sun May 28 03:15:13 2017
Author: apache.


This document was translated from BibTEX by bibtex2html