David M. Kunzman

dblp:94/2305 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Hardware accelerators and domain-specific architectures · 41% Processor architecture and microarchitecture · 41% Parallel and multicore computing · 17%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
accelerator programming models
0.222009
Towards a framework for abstracting accelerators in parallel applications: experience with cell · SC 2009
Poster reception - Charm++ simplifies coding for the cell processor · SC 2006
Processor architecture and microarchitecture › chip multiprocessor
cell processor
0.222009
Towards a framework for abstracting accelerators in parallel applications: experience with cell · SC 2009
Poster reception - Charm++ simplifies coding for the cell processor · SC 2006
Parallel and multicore computing
parallel programming models
0.022009
Towards a framework for abstracting accelerators in parallel applications: experience with cell · SC 2009
Poster reception - Charm++ simplifies coding for the cell processor · SC 2006
Parallel and multicore computing
parallel programming runtimes
0.012006
Poster reception - Charm++ simplifies coding for the cell processor · SC 2006

Methods — techniques the papers use, named apart from their topics

runtime scheduling · 0.1parallel programming framework · 0.1runtime system · 0.1offload API · 0.1
YearPublicationVenuePosition
2009 Towards a framework for abstracting accelerators in parallel applications: experience with cell
abstract
While accelerators have become more prevalent in recent years, they are still considered hard to program. In this work, we extend a framework for parallel programming so that programmers can easily take advantage of the Cell processor's Synergistic Processing Elements (SPEs) as seamlessly as possible. Using this framework, the same application code can be compiled and executed on multiple platforms, including x86-based and Cell-based clusters. Furthermore, our model allows independently developed libraries to efficiently time-share one or more SPEs by interleaving work from multiple libraries. To demonstrate the framework, we present performance data for an example molecular dynamics (MD) application. When compared to a single Xeon core utilizing streaming SIMD extensions (SSE), the MD program achieves a speedup of 5.74 on a single Cell chip (with 8 SPEs). In comparison, a similar speedup of 5.89 is achieved using six Xeon (x86) cores.
David M. Kunzman, Laxmikant V. Kalé
SC1
2006 Poster reception - Charm++ simplifies coding for the cell processor
abstract
While the Cell processor, jointly developed by IBM, Sony, and Toshiba, has great computational power, it also presents many challenges including portability and ease of programming. We have been adapting the Charm++ Runtime System to utilize the Cell. We believe that the Charm++ model fits well with the Cell for many reasons: encapsulation of data, effective prefetching, the ability to peak ahead in message queues, virtualization, etc. To these ends, we have developed the Offload API (an independent code) which allows Charm++ applications to easily take advantage of the Cell. Our goal is to allow Charm++ programs to run on Cell-based and non-Cell-based platforms without modification to application code. Example Charm++ programs using the Offload API already exist. We have also begun modifying NAMD, a popular molecular dynamics code, to use the Cell. In this poster, we plan to present current progress and future plans for this work.
David M. Kunzman, Gengbin Zheng, Eric J. Bohm, James C. Phillips, Laxmikant V. Kalé
SC1