%0 Conference Proceedings
%T Stroll: A Universal Filesystem-Based Interface for Seamless Task Deployment in Grid Computing
%+ Dept. of Electrical Engineering and Computer Science
%A Azab, Abdulrahman
%A Meling, Hein
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 12th International Conference on Distributed Applications and Interoperable Systems (DAIS)
%C Stockholm, Sweden
%Y Karl Michael Göschka
%Y Seif Haridi
%I Springer
%3 Distributed Applications and Interoperable Systems
%V LNCS-7272
%P 162-176
%8 2012-06-13
%D 2012
%R 10.1007/978-3-642-30823-9_14
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Developing applications for solving compute intensive problems is not trivial. Despite availability of a range of Grid computing platforms, domain specialists and scientists only rarely take advantage of these computing facilities. One reason for this is the complexity of Grid computing, and the need to learn a new programming environment to interact with the Grid. Typically, only a few programming languages are supported, and often scientists use special-purpose languages that are not supported by most Grid platforms. Moreover, users cannot easily deploy their compute tasks to multiple Grid platforms without rewriting their program to use different task submission interfaces.In this paper we present Stroll, a universal filesystem-based interface for seamless task submission to one or more Grid facilities. Users interact with the Grid through simple read and write filesystem commands. Stroll allows all categories of users to submit and manage compute tasks both manually, and from within their programs, which may be written in any language. Stroll has been implemented on Windows and Linux, and we demonstrate that we can submit the same compute tasks to both Condor and Unicore clusters. Our evaluation shows the overhead of Stroll to negligible. Comparing the code complexity of a Stroll compute task with command-line clients and Grid APIs show that Stroll can eliminated up to 95% of the complexity.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01527637/document
%2 https://inria.hal.science/hal-01527637/file/978-3-642-30823-9_14_Chapter.pdf
%L hal-01527637
%U https://inria.hal.science/hal-01527637
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-DAIS
%~ IFIP-LNCS-7272