By Topic

Programming Models for Grid Applications and Systems: Requirements and Approaches

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kielmann, T. ; Vrije Universiteit, Amsterdam

History repeats itself. Since the invention of the programmable computer, numerous computer scientists keep dedicating their professional lives to the design of "the single, best" programming model, whereas programmers "vote" by choosing their favourite languages and tools. Interestingly, these choices have always been guided by non-functional properties. For programming a single computer, the most widely used models have become object-oriented and component-based programming, a choice driven by their high abstraction level, leading to high programmer productivity. For parallel computers, the winner turned out to be message passing, providing by far not the highest-possible abstraction level, but the closest match between machine architecture and programming model, leading to efficient program execution. For grids, the race is still open. Here, additional nonfunctional properties like fault-tolerance, security, and platform independence enter the scene. In this paper, we explore the scope of grid programming problems and argue for a palette of programming abstractions, each suitable for its respective problem domain

Published in:

Modern Computing, 2006. JVA '06. IEEE John Vincent Atanasoff 2006 International Symposium on

Date of Conference:

3-6 Oct. 2006