Network Fusion

Pascal Fradet 1 Stéphane Hong Tuan Ha 2
2 Lande - Logiciel : ANalyse et DEveloppement
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Modular programming enjoys many well-known advantages but the composition of modular units may also lead to inefficient programs. In this paper, we propose an invasive composition method which strives to reconcile modularity and efficiency. Our technique, network fusion, automatically merges networks of interacting components into equivalent sequential programs. We provide the user with an expressive language to specify scheduling constraints which can be taken into account during network fusion. Fusion allows to replace internal communications by assignments and alleviates most time overhead. We present our approach in a generic and unified framework based on labeled transition systems, static analysis and transformation techniques.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00000945
Contributor : Pascal Fradet <>
Submitted on : Thursday, December 15, 2005 - 5:51:11 PM
Last modification on : Friday, November 16, 2018 - 1:22:30 AM
Long-term archiving on : Friday, February 11, 2011 - 4:37:26 PM

Identifiers

  • HAL Id : inria-00000945, version 1

Citation

Pascal Fradet, Stéphane Hong Tuan Ha. Network Fusion. Asian Symposium on Programming Languages and Systems, Nov 2004, Taipei, Taiwan. ⟨inria-00000945⟩

Share

Metrics

Record views

312

Files downloads

155