124 search results - page 7 / 25 » Dynamic Function Placement for Data-Intensive Cluster Comput... |
SG
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This paper introduces a new method to determine appealing placements of textual annotations for complex-shaped geometric models. It employs dynamic potential fields, whi...
RT
2004
Springer
15 years 2 months ago
2004
Springer
Self-shadowing is an important factor in the appearance of hair and fur. In this paper we present a new rendering algorithm to accurately compute shadowed hair at interactive rate...
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
118
click to vote
ECRTS
2007
IEEE
15 years 3 months ago
2007
IEEE
Many embedded systems feature processors coupled with a small and fast scratchpad memory. To the difference with caches, allocation of data to scratchpad memory must be handled by...
VEE
2009
ACM
15 years 4 months ago
2009
ACM
Clusters provide powerful computing environments, but in practice much of this power goes to waste, due to the static allocation of tasks to nodes, regardless of their changing co...