Staff View
Spatial views : iterative spatial programming for networks of embedded systems

Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
1 online resource (10 pages) : illustrations
Note (type = special display note)
Technical report DCS-TR-493
Name (authority = RutgersOrg-School); (type = corporate)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (authority = RutgersOrg-Department); (type = corporate)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
Spatial views : iterative spatial programming for networks of embedded systems
Abstract (type = abstract)
Programming a large network of embedded systems (NES) is an enormous challenge since all or subsets of nodes cooperate to achieve a particular goal. Recently proposed Spatial Programming makes networking transparent to the programmer by providing a consistent spatial and content-based naming scheme for spatially distributed network resources. In Spatial Programming, NES applications appear as simple sequential programs using spatial variables. However, for many NES applications the spatial programming model can be further abstracted, by factoring out the spatial scope from resource naming and expressing the execution iteratively within that scope. In this paper, we propose Spatial Views, a high-level abstraction for spatial programming which allows programs (iterators) to be executed over a dynamic set of nodes with similar properties and location. The execution of a spatial view iterator can be constrained by multiple conditions such as time, energy, etc., and hence, can terminate prematurely with a certain quality of result (QoR). In this paper, we also show how spatial view iterators can be translated into Smart Messages, a distributed computing programming environment for NES based on execution migration and self-routing.
Name (type = personal)
NamePart (type = family)
Kremer
NamePart (type = given)
Ulrich
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
Name (type = personal)
NamePart (type = family)
Iftode
NamePart (type = given)
Liviu
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
Name (type = personal)
NamePart (type = family)
Hom
NamePart (type = given)
Jerry
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
Name (type = personal)
NamePart (type = family)
Ni
NamePart (type = given)
Yang
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
OriginInfo
DateCreated (encoding = w3cdtf); (keyDate = yes); (qualifier = exact)
2002-06
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/t3-wgrr-em56
Genre (authority = ExL-Esploro)
Technical Documentation
Back to the top

Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
Document
CreatingApplication
Version
1.4
ApplicationName
GPL Ghostscript 9.07
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:31:37
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:31:37
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2020