This paper introduces a method for bounding the worst-case performance of programs running on multithreaded processors, such as the embedded cores found within network processors (NPs). Worst-case bounds can be useful in determining whether a given software implementation will provide stable (e.g., line rate) performance under all traffic conditions. Our method extends an approach from the real...

We prove some new concentration inequalities for self-bounding functions using the entropy method. As an application, we recover Talagrand’s convex distance inequality. The new Bernstein-like inequalities for self-bounding functions are derived thanks to a careful analysis of the so-called Herbst argument. The latter involves comparison results between solutions of differential inequalities tha...

Oriented bounding box (OBB) hierarchies can be used instead of based on axis-aligned boxes (AABB), providing tighter fitting to the underlying geometric structures and resulting in improved interference tests, such as ray-geometry intersections. In this paper, we present a method for fast, parallel transformation an existing volume hierarchy (BVH), AABBs, into oriented boxes. To end, parallelis...

Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy them independently, but difficult to satisfy them simultaneously. Therefore, the standard propagation methods fail. In this paper we propose a novel approach inspired in multi-objective optimization. We compute a mul...

We present a new acceleration scheme for continuous collision detection of objects under arbitrary deformations. Both pairwise and self collision detection are presented. This scheme is facilitated by a new acceleration data structure, the kinetic separation list. The event-based approach of our kinetic separation list enables us to transform the continuous problem into a discrete one. Thus, th...

We provide a simple sufficient condition for the existence of a recursive upper bound on (the Pareto frontier of) the sequential equilibrium payoff set at a fixed discount factor in two-player repeated games with imperfect private monitoring. The bounding set is the sequential equilibrium payoff set with perfect monitoring and a mediator. We show that this bounding set admits a simple recursive...

Bounding surfaces and interdune deposits provide keys for detailed interpretations of the development, shape, type, wavelength and angle of climb of aeolian bedforms, as well as overall sand sea conditions. Current alternate interpretations of bounding surfaces require very different, but testable models for sand sea deposition. Two perpendicular traverses of Jurassic Entrada Sandstone, Utah, r...

We describe a resource bounding technique called the Flow Balance Constraint (FBC) to tightly bound the amount of available resource for a set of partially ordered events with piecewise constant resource impact. We provide an efficient algorithm for calculating FBC and bound its complexity. We compare this technique with two existing resource bounding techniques, the Balance Constraint (BC) due...