The ideal latency for on-chip network traversal would be the delay incurred from wire alone. Unfortunately, in a realistic modular network, packet to traverse is significantly higher than this delay. main limiter achieving lower quantization of into hops. Beyond this, physical heterogeneity real-world systems further complicate ability reach wire-only In work, we propose TNT or Transparent Netw...

Traversals of heterogeneous object structures are the most common operations in schema-first applications where the three key issues are (1) separation of traversal specifications from type-specific actions, (2) expressiveness and reusability of traversal specifications, and (3) supporting structure-shy traversal specifications that require minimal adaptation in the face of schema evolution. Th...

We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...

The ever increasing size of data sets for scientific and medical visualization demands new isosurface volume rendering techniques to provide interactivity for the large datasets. The main obstacle to achieving interactivity is the computational bottleneck due to the dataset traversal and the corresponding amount of data transfer. We propose a novel GPU based dataset traversal technique that use...

We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...

Strategic programming is a generic programming idiom for processing compound data such as terms or object structures. At the heart of the approach is the separation of two concerns: basic data-processing computations vs. traversal schemes. Actual traversals can be composed by passing the former as arguments to the latter. Traversal schemes can be defined by the strategic programmer using a comb...