Resource-agnostic programming for many-core microgrids

Authors:
Thomas A. M. Bernard;Clemens Grelck;Michael A. Hicks;Chris R. Jesshope;Raphael Poss
Affiliations:
University of Amsterdam, Informatics Institute, The Netherlands;University of Amsterdam, Informatics Institute, The Netherlands;University of Amsterdam, Informatics Institute, The Netherlands;University of Amsterdam, Informatics Institute, The Netherlands;University of Amsterdam, Informatics Institute, The Netherlands
Venue:
Euro-Par 2010 Proceedings of the 2010 conference on Parallel processing
Year:
2010

Citing 8
Cited 0

I-structures: data structures for parallel computing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Cilk: an efficient multithreaded runtime system

PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Data-Driven Multithreading Using Conventional Microprocessors

IEEE Transactions on Parallel and Distributed Systems
Survey on Parallel Programming Model

NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
Implementation and evaluation of a microthread architecture

Journal of Systems Architecture: the EUROMICRO Journal
The multicore programming challenge

APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
On-chip COMA cache-coherence protocol for microgrids of microthreaded cores

Euro-Par'07 Proceedings of the 2007 conference on Parallel processing
µTC: an intermediate language for programming chip multiprocessors

ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many-core architectures are a commercial reality, but programming them efficiently is still a challenge, especially if the mix is heterogeneous. Here granularity must be addressed, i.e. when to make use of concurrency resources and when not to. We have designed a data-driven, fine-grained concurrent execution model (SVP) that captures concurrency in a resource-agnostic way. Our approach separates the concern of describing a concurrent computation from its mapping and scheduling. We have implemented this model as a novel many-core architecture programmed with a language called µTC. In this paper we demonstrate how we achieve our goal of resource-agnostic programming on this target, where heterogeneity is exposed as arbitrarily sized clusters of cores.