Literature Database Entry
fahringer2005askalon
Thomas Fahringer, Radu Prodan, Rubing Duan, Francesco Nerieri, Stefan Podlipnig, Jun Qin, Mumtaz Siddiqui, Hong-Linh Truong, Alex Villazon and Marek Wieczorek, "ASKALON: A Grid Application Development and Computing Environment," Proceedings of 6th IEEE/ACM International Workshop on Grid Computing (GRID 2005), Seattle, WA, November 2005.
Abstract
We present the ASKALON environment whose goal is to simplify the development and execution of workflow applications on the Grid. ASKALON is centered around a set of high-level services for transparent and effective Grid access, including a Scheduler for optimized mapping of workflows onto the Grid, an Enactment Engine for reliable application execution, a Resource Manager covering both computers and application components, and a Performance Prediction service based on training phase and statistical methods. A sophisticated XML-based programming interface that shields the user from the Grid middleware details allows the high-level composition of workflow applications. ASKALON is used to develop and port scientific applications as workflows in the Austrian Grid project. We present experimental results using two real-world scientific applications to demonstrate the effectiveness of our approach.
Quick access
Original Version
(at publishers web site)
BibTeX ![]()
Contact
Thomas Fahringer
Radu Prodan
Rubing Duan
Francesco Nerieri
Stefan Podlipnig
Jun Qin
Mumtaz Siddiqui
Hong-Linh Truong
Alex Villazon
Marek Wieczorek
BibTeX reference
@inproceedings{fahringer2005askalon,
author = {Fahringer, Thomas and Prodan, Radu and Duan, Rubing and Nerieri, Francesco and Podlipnig, Stefan and Qin, Jun and Siddiqui, Mumtaz and Truong, Hong-Linh and Villazon, Alex and Wieczorek, Marek},
doi = {10.1109/GRID.2005.1542733},
title = {{ASKALON: A Grid Application Development and Computing Environment}},
publisher = {IEEE},
address = {Seattle, WA},
booktitle = {6th IEEE/ACM International Workshop on Grid Computing (GRID 2005)},
month = {11},
year = {2005},
}
Copyright notice
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
This page was automatically generated using BibDB and bib2web.








