Re-scheduling invocations of services on RPC-based Grid

Re-scheduling invocations of services on RPC-based Grid

RPC-basedgrid infrastructures emphasize on the composition of services on a large number of computing resources. The key issue to reach high performance is to enable exploitation of parallelism on servicesinvocations and communications. Moreover, this process should be transparent to reuse legacy co...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer languages, systems & structures systems & structures, 2007, Vol.33 (3-4), p.168-178
Hauptverfasser: Gautier, Thierry, Hamidi, Hamid-Reza
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Other
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 178
container_issue 3-4
container_start_page 168
container_title Computer languages, systems & structures
container_volume 33
creator Gautier, Thierry
Hamidi, Hamid-Reza
description RPC-basedgrid infrastructures emphasize on the composition of services on a large number of computing resources. The key issue to reach high performance is to enable exploitation of parallelism on servicesinvocations and communications. Moreover, this process should be transparent to reuse legacy codes. In this paper we present HOMA, an IDL compiler and a run-time support for automatic detection of the parallelism of invocations and their data dependencies on a set of CORBA objects. On homogeneous architecture, HOMA is accompanied by a predictable cost model. In the case of an application with a small critical path, among p processors the speed up of HOMA versus CORBA is asymptotically O(p). The illustrations on a case study in computational chemistry validate our cost model.
doi_str_mv 10.1016/j.cl.2006.07.006
format Article
fullrecord <record><control><sourceid>hal</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00684614v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_00684614v1</sourcerecordid><originalsourceid>FETCH-hal_primary_oai_HAL_hal_00684614v13</originalsourceid><addsrcrecordid>eNqVjrsOwiAARRk0sT52R1YHECqWrqZROziYxp0gpZYGwYA28e-tiT_gdG5O7nAAWFKCKaHZusPK4pSQDBOOB4xAQhnnKGcpm4BpjB0hKcnZNgG80iiqVtcva9wNGtd7JZ_Guwh9A6MOvVF62A5W5wJdZdQ1PAZTz8G4kTbqxY8zsDrsL0WJWmnFI5i7DG_hpRHl7iS-bsjIWUZZTzf_fD81jj3I</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Re-scheduling invocations of services on RPC-based Grid</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Gautier, Thierry ; Hamidi, Hamid-Reza</creator><creatorcontrib>Gautier, Thierry ; Hamidi, Hamid-Reza</creatorcontrib><description>RPC-basedgrid infrastructures emphasize on the composition of services on a large number of computing resources. The key issue to reach high performance is to enable exploitation of parallelism on servicesinvocations and communications. Moreover, this process should be transparent to reuse legacy codes. In this paper we present HOMA, an IDL compiler and a run-time support for automatic detection of the parallelism of invocations and their data dependencies on a set of CORBA objects. On homogeneous architecture, HOMA is accompanied by a predictable cost model. In the case of an application with a small critical path, among p processors the speed up of HOMA versus CORBA is asymptotically O(p). The illustrations on a case study in computational chemistry validate our cost model.</description><identifier>ISSN: 1477-8424</identifier><identifier>DOI: 10.1016/j.cl.2006.07.006</identifier><language>eng</language><publisher>Elsevier</publisher><subject>Computer Science ; Other</subject><ispartof>Computer languages, systems &amp; structures, 2007, Vol.33 (3-4), p.168-178</ispartof><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,4023,27922,27923,27924</link.rule.ids><backlink>$$Uhttps://inria.hal.science/hal-00684614$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Gautier, Thierry</creatorcontrib><creatorcontrib>Hamidi, Hamid-Reza</creatorcontrib><title>Re-scheduling invocations of services on RPC-based Grid</title><title>Computer languages, systems &amp; structures</title><description>RPC-basedgrid infrastructures emphasize on the composition of services on a large number of computing resources. The key issue to reach high performance is to enable exploitation of parallelism on servicesinvocations and communications. Moreover, this process should be transparent to reuse legacy codes. In this paper we present HOMA, an IDL compiler and a run-time support for automatic detection of the parallelism of invocations and their data dependencies on a set of CORBA objects. On homogeneous architecture, HOMA is accompanied by a predictable cost model. In the case of an application with a small critical path, among p processors the speed up of HOMA versus CORBA is asymptotically O(p). The illustrations on a case study in computational chemistry validate our cost model.</description><subject>Computer Science</subject><subject>Other</subject><issn>1477-8424</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNqVjrsOwiAARRk0sT52R1YHECqWrqZROziYxp0gpZYGwYA28e-tiT_gdG5O7nAAWFKCKaHZusPK4pSQDBOOB4xAQhnnKGcpm4BpjB0hKcnZNgG80iiqVtcva9wNGtd7JZ_Guwh9A6MOvVF62A5W5wJdZdQ1PAZTz8G4kTbqxY8zsDrsL0WJWmnFI5i7DG_hpRHl7iS-bsjIWUZZTzf_fD81jj3I</recordid><startdate>2007</startdate><enddate>2007</enddate><creator>Gautier, Thierry</creator><creator>Hamidi, Hamid-Reza</creator><general>Elsevier</general><scope>1XC</scope></search><sort><creationdate>2007</creationdate><title>Re-scheduling invocations of services on RPC-based Grid</title><author>Gautier, Thierry ; Hamidi, Hamid-Reza</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-hal_primary_oai_HAL_hal_00684614v13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Computer Science</topic><topic>Other</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gautier, Thierry</creatorcontrib><creatorcontrib>Hamidi, Hamid-Reza</creatorcontrib><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Computer languages, systems &amp; structures</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gautier, Thierry</au><au>Hamidi, Hamid-Reza</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Re-scheduling invocations of services on RPC-based Grid</atitle><jtitle>Computer languages, systems &amp; structures</jtitle><date>2007</date><risdate>2007</risdate><volume>33</volume><issue>3-4</issue><spage>168</spage><epage>178</epage><pages>168-178</pages><issn>1477-8424</issn><abstract>RPC-basedgrid infrastructures emphasize on the composition of services on a large number of computing resources. The key issue to reach high performance is to enable exploitation of parallelism on servicesinvocations and communications. Moreover, this process should be transparent to reuse legacy codes. In this paper we present HOMA, an IDL compiler and a run-time support for automatic detection of the parallelism of invocations and their data dependencies on a set of CORBA objects. On homogeneous architecture, HOMA is accompanied by a predictable cost model. In the case of an application with a small critical path, among p processors the speed up of HOMA versus CORBA is asymptotically O(p). The illustrations on a case study in computational chemistry validate our cost model.</abstract><pub>Elsevier</pub><doi>10.1016/j.cl.2006.07.006</doi></addata></record>
fulltext fulltext
identifier ISSN: 1477-8424
ispartof Computer languages, systems & structures, 2007, Vol.33 (3-4), p.168-178
issn 1477-8424
language eng
recordid cdi_hal_primary_oai_HAL_hal_00684614v1
source ScienceDirect Journals (5 years ago - present)
subjects Computer Science
Other
title Re-scheduling invocations of services on RPC-based Grid
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T17%3A19%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Re-scheduling%20invocations%20of%20services%20on%20RPC-based%20Grid&rft.jtitle=Computer%20languages,%20systems%20&%20structures&rft.au=Gautier,%20Thierry&rft.date=2007&rft.volume=33&rft.issue=3-4&rft.spage=168&rft.epage=178&rft.pages=168-178&rft.issn=1477-8424&rft_id=info:doi/10.1016/j.cl.2006.07.006&rft_dat=%3Chal%3Eoai_HAL_hal_00684614v1%3C/hal%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true