next up previous
Next: Publications Up: Jeffrey D. Oldham Previous: Work Experience


Software Development

VSIPL++ (2002-)

CODESOURCERY, LLC. Programmed open-source reference implementation for VSIPL++ toolkit. This C++ toolkit supports solving vector, signal, and image processing problems in serial environments with intuitive, algorithmic syntax. This work will be extended to support multi-processor execution. Work funded by the Department of Defense High Performance Embedded Computing Software Initiative administered through MIT Lincoln Laboratory.

C++ ABI Testsuite (2002-2003)

CODESOURCERY, LLC. Itanium C++ Application Binary Interface used by G++, Intel, and most other C++ compilers. Commercially available from CodeSourcery. Implemented using Python, C++, and the QMTest testing framework.

POOMA C++ Toolkit (2001)

CODESOURCERY, LLC. Revised the Field abstraction, simplifying and supporting multiple values per cell. Ported the library to recent compilers and operating systems. Wrote a user manual.

Generalized Shortest Paths Implementations (1998-99)


Implementations of several different generalized shortest path algorithms. These algorithms are a combination of geometric search and dynamic-programming implementations. We show that different Bellman-Ford-Moore-like implementations have asymptotically different running times and these running times differ from those for ordinary shortest path problems.

Multicommodity Flow Approximation Implementation (1995-97)


The program solves the network flow optimization problems of minimum-cost and no-cost multicommodity flows. The problems involve allocating shared resources among flows between different locations. Given a graph, an arc capacity function, a set of commodities (a source node, a destination node, and a demand), and an arc cost function, determine the cheapest way to route each commodity's flow so the total flow (of all the commodities) on any arc is at most its capacity.

DNA Sequence Alignment Program (Spring 1995)


Given two character sequences, e.g., DNA bases, introduce gaps into the sequences so as many characters match as possible. Sequence alignment is used frequently to identify and match gene sequences. This dynamic programming implementation has been used in Stanford University's MIS 214/CS 274 course since 1995.

ParaScope Editor (May 1991-May 1992)


Added color graphics to the ParaScope Editor research tool, an interactive tool to find and exploit parallelism in sequential Fortran programs.

next up previous
Next: Publications Up: Jeffrey D. Oldham Previous: Work Experience