processor, making the scheduler partition-aware can lead to inter-core locality benefits for other structures as well. For example, in Delaunay mesh generation, this data-centric scheduling policy ensures that different cores work on triangles from different partitions of the mesh, reducing data contention and the likelihood of speculation conflicts. It is not clear that data-centric scheduling...

In recent years we have seen an increasing interest in irregular topologies in the interconnect communities. The predominant routing strategy for such networks is the up*/down* algorithm proposed in connection with Autonet. One problem with this algorithm is that it creates a configuration that is very prone to hot-spots near the root of the up*/down* tree. Previous methods for handling this pr...

This paper examines the limits of performance in systems with periodic irregular sampling rate when the actuation is not necessarily synchronized with the sampling. For such a system, three sampling and actuation schemes are considered: when the sampling and control rate are both regular, when they are both irregular, and when the sampling rate is irregular while the control rate is regular. To...

This paper presents an approximation of navigation problem under unknown environment using reinforcement learning. The motivation is to represent a robot that can move in a world with streets and intersections. Each intersection has a different quantity of streets (irregular blocks). The selected algorithms were Q-Learning and Value Iteration. The robot was programmed only with Q-Learning and w...

In recent years we have seen a growing interest in irregular network topologies for cluster interconnects. One problem related to such topologies is that the combination of shortest path and deadlock free routing is difficult. As a result of this the existing solutions for routing in irregular networks either guarantee shortest paths relative to some constraint (like up*/down*), or have to reso...