Literature Database Entry

struebe2010stateful2


Moritz Strübe, Rüdiger Kapitza, Klaus Stengel, Michael Daum and Falko Dressler, "Stateful Mobile Modules for Robust In-network Processing," Proceedings of 5th ACM European Conference on Computer Systems (EuroSys 2010), Poster Session, Paris, France, April 2010.

Abstract

Most sensor-network applications are dominated by the acquisition of sensor values. Due to energy limitations and high energy costs of communication, in-network processing has been proposed as a means to reduce data transfers. As application demands may change over time and nodes run low on energy, get overloaded, or simply face debasing communication capabilities, runtime adaptation is required. In either case, it is valuable to be able to migrate computations between neighboring nodes without losing runtime state that might be costly or even impossible to recompute. We propose stateful mobile modules as a basic infrastructure building block to improve adaptiveness and robustness of in-network processing applications. Stateful mobile modules are binary modules linked on the node itself. Even more importantly, they can be transparently migrated from one node to another, thereby keeping statically as well as dynamically allocated memory. This is achieved by an optimized linking process and an advanced programming support.

Quick access

Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Moritz Strübe
Rüdiger Kapitza
Klaus Stengel
Michael Daum
Falko Dressler

BibTeX reference

@inproceedings{struebe2010stateful2,
    author = {Str{\"{u}}be, Moritz and Kapitza, R{\"{u}}diger and Stengel, Klaus and Daum, Michael and Dressler, Falko},
    title = {{Stateful Mobile Modules for Robust In-network Processing}},
    booktitle = {5th ACM European Conference on Computer Systems (EuroSys 2010), Poster Session},
    year = {2010},
    month = {April},
    address = {Paris, France},
    publisher = {ACM},
   }
   
   

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.