TACO — Dynamic distributed collections with templates and topologies

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

High-level data-parallel programming with distributed object sets eases many aspects of parallel programming. In this paper we describe the design and implementation of Taco, a template library that provides higher-order operations on polymorphic regular and irregular distributed object sets by means of reusable topology classes and C++ function templates. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Nolte, J., Sato, M., & Ishikawa, Y. (2000). TACO — Dynamic distributed collections with templates and topologies. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1900, 1071–1080. https://doi.org/10.1007/3-540-44520-x_151

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free