Towards Dilated Placement of Dynamic NoC Cores

Instead of mapping application task graphs in a compact manner onto reconfigurable devices using a network-on-chip for interconnecting application cores, we propose dilating the mappings as much as the available latencies on critical connections allow. In a dilated mapping, the unused resources between an application\u27s configured components can be used to provide additional flexibility when the configuration needs to change. We motivate the reasons for dilating application task graphs targeted at reconfigurable devices; derive a simulated annealing approach to dilating the placement of such graphs; and present preliminary results of applying the algorithm to synthetic test cases. The method appears to result in successful and meaningful graph dilation and could be further tuned to satisfy desired power constraints

Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing

International audienceWe experiment with an alternative routing scheme for the robust network loading problem with demand uncertainty. Named k‐adaptive, it is based on the fact that the decision‐maker chooses k second‐stage solutions and then commits to one of them only after realization of the uncertainty. This routing scheme, with its corresponding k‐partition of the uncertainty set, is dynamically defined under an iterative method to sequentially improve the solution. The method has an inherent characteristic of multiplying the number of variables and constraints after each iteration, so that additional measures are introduced in the solution strategy in order to control time performance. We compare our k‐adaptive results with the ones obtained through other routing schemes and also verify the effectiveness of the methods utilized using several realistic networks from SNDlib and other sources

A simple and optimal ancestry labeling scheme for trees

We present a $\lg n + 2 \lg \lg n+3$ ancestry labeling scheme for trees. The problem was first presented by Kannan et al. [STOC 88'] along with a simple $2 \lg n$ solution. Motivated by applications to XML files, the label size was improved incrementally over the course of more than 20 years by a series of papers. The last, due to Fraigniaud and Korman [STOC 10'], presented an asymptotically optimal $\lg n + 4 \lg \lg n+O(1)$ labeling scheme using non-trivial tree-decomposition techniques. By providing a framework generalizing interval based labeling schemes, we obtain a simple, yet asymptotically optimal solution to the problem. Furthermore, our labeling scheme is attained by a small modification of the original $2 \lg n$ solution.Comment: 12 pages, 1 figure. To appear at ICALP'1

Exploring applicability of the workload control concept

To be successful in companies, a production planning and control (PPC) concept should fit to the production environment. Essential elements of the concept should correspond with the characteristics of the production system. For classical concepts such as MRP these elements have become common sense. For example BOMexplosion and constant lead times make MRP known to perform best in environments with high material and low capacity complexity. For many other concepts the situation is less clear. In this paper the Workload Control (WLC) concept is considered for which the requirements for a successful application have never been investigated. A framework is proposed to explore the applicability of WLC in small- to medium-sized make-to-order (MTO) companies. It supports an initial consideration of WLC in the first phase of a PPC selection and implementation process. As a first step in developing the framework the inherent characteristics of the WLC concept and the relevant MTO production characteristics are identified. Confronting the indicators of the company characteristics with the WLC elements results in bestfit indications for the WLC concept. Contrarily to other PPC evaluation schemes the framework considers variability indicators besides averages. Use of this framework for a medium sized MTO company demonstrates its suitability in getting a systematic and quick impression of the applicability of WLC. Essential elements are treated and assessed.

Persistent Visitation with Fuel Constraints

AbstractThis work is motivated by the periodic vehicle routing problem (PVRP) where a vehicle is to perpetually visit customers within a given area. In this work there is no sense of horizon or days as in classic PVRP. Instead, it is assumed that each customer has a rate at which it must be visited for the vehicle to satisfy its mission. The vehicle's fuel limitations are taken into account and fuel depots with a fixed fuel price are included. The problem of finding paths that satisfy the locations’ revisit rates and minimize the total cost of fuel is treated. An algorithm that provides solutions to this problem under given constraints is presented