On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops
DOI: 10.1007/978-3-540-76890-6_13
|View full text |Cite
|
Sign up to set email alerts
|

Scalable Inter-vehicular Applications

Abstract: Abstract. Many pervasive inter-vehicular applications involve the collation, processing and summarisation of sensor data originating from vehicles. When and where such processing takes place is an explicit designstage decision. Often some processing occurs on vehicles, and some on backend servers, but it is hard for the programmer to optimise this distribution for feasibility or performance. This paper investigates automated task assignment: we define a computational model which captures data aggregation and s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
(13 reference statements)
0
1
0
Order By: Relevance
“…As part of this process, the annotations associated with processors and communication links in the co-ordinator file are combined with the cost function to determine the relative suitability of any particular mapping of tasks to processors. As noted earlier this is a well-studied area, and we have not developed a state-of-the-art assignment algorithm, but have used a simple technique [8] to explore both task assignment and program transformation simultaneously. In our solution, we initially assign all unmapped tasks to reachable nodes with the largest aggregate connectivity.…”
Section: Current Implementationmentioning
confidence: 99%
“…As part of this process, the annotations associated with processors and communication links in the co-ordinator file are combined with the cost function to determine the relative suitability of any particular mapping of tasks to processors. As noted earlier this is a well-studied area, and we have not developed a state-of-the-art assignment algorithm, but have used a simple technique [8] to explore both task assignment and program transformation simultaneously. In our solution, we initially assign all unmapped tasks to reachable nodes with the largest aggregate connectivity.…”
Section: Current Implementationmentioning
confidence: 99%