Search

Your search keyword '"Vannelli, Anthony"' showing total 71 results
Start Over Author "Vannelli, Anthony"
71 results on '"Vannelli, Anthony"'

56. Packing Trees in Communication Networks.

Author

Xiaotie Deng, Yinyu Ye, Saad, Mohamed, Terlaky, Tamás, Vannelli, Anthony, and Hu Zhang

Abstract

Given an undirected edge-capacitated graph and a collection of subsets of vertices, we consider the problem of selecting a maximum (weighted) set of Steiner trees, each spanning a given subset of vertices without violating the capacity constraints. We give an integer linear programming (ILP) formulation, and observe that its linear programming (LP-) relaxation is a fractional packing problem with exponentially many variables and with a block (sub-)problem that cannot be solved in polynomial time. To this end, we take an r-approximate block solver to develop a approximation algorithm for the LP-relaxation. The algorithm has a polynomial coordination complexity for any . To the best of our knowledge, this is the first approximation result for fractional packing problems with only approximate block solvers and a coordination complexity that is polynomial in the input size and . This leads to an approximation algorithm for the underlying tree packing problem. Finally, we extend our results to an important multicast routing and wavelength assignment problem in optical networks, where each Steiner tree is also to be assigned one of a limited set of given wavelengths, so that trees crossing the same fiber are assigned different wavelengths. [ABSTRACT FROM AUTHOR]

Published
2005
Full Text
View/download PDF

57. On Routing in VLSI Design and Communication Networks.

Author

Xiaotie Deng, Dingzhu Du, Terlaky, Tamás, Vannelli, Anthony, and Hu Zhang

Abstract

In this paper, we study the global routing problem in VLSI design and the multicast routing problem in communication networks. We first propose new and realistic models for both problems. Both problems are -hard. We present the integer programming formulation of both problems and solve the linear programming (LP) relaxations approximately by the fast approximation algorithms for min-max resource-sharing problems in [10]. For the global routing problem, we investigate particular properties of lattice graphs and propose a combinatorial technique to overcome the hardness due to the bend-dependent vertex cost. Finally we develop asymptotic approximation algorithms for both problems depending on the best known approximation ratio for the minimum Steiner tree problem. They are the first known theoretical approximation bound results for these problems. [ABSTRACT FROM AUTHOR]

Published
2005
Full Text
View/download PDF

67. A Power-Efficient Multipin ILP-Based Routing Technique.

Author

Youssef, Ahmed, Zhen Yang, Anis, Mohab, Areibi, Shawki, Vannelli, Anthony, and Elmasry, Mohamed

Subjects
INTEGRATED circuits, INTEGRATED circuit interconnections, ROUTING (Computer network management), INTEGER programming, LINEAR programming, MATHEMATICAL optimization
Abstract

With the ever increasing die sizes and the accompanied increase in the average global interconnect length, delay-optimal-routing and buffer-insertion techniques are significantly straining the power budget of modern ICs. To mitigate the impact of the power consumed by the interconnects and buffers, a power-efficient multipin routing technique is proposed in this paper. The problem is based on a graph representation of the routing possibilities, with the objective of identifying the minimum power path between the interconnect source and set of sinks. The technique is tested by applying it to the International Symposium on Physical Design and IBM benchmarks to verify the accuracy, complexity, and solution quality. Results obtained indicate that an average power saving as high as 32% for the 130-nm technology is achieved with no impact on the maximum chip frequency. [ABSTRACT FROM AUTHOR]

Published
2010
Full Text
View/download PDF

71. Energy Monitoring System for Security and Energy Management Applications

Author

Shariati, Sepideh, Muresan, Radu, and Vannelli, Anthony

Subjects
switched-capacitor integrator, energy measurement circuit, mixed-signal FPGA, energy monitoring system
Abstract

This thesis presents an energy monitoring system to measure energy consumption of software applications to support security and power management for embedded devices. The proposed system is composed of an Actel Fusion device and a custom designed energy measurement circuit. The Fusion device measures the voltage and the current of the target device at a defined sampling rate. The energy measurement circuit is designed as a current integrator over fixed intervals using the switched-capacitor integrator technique to store energy information of the target device within Fusion’s sampling intervals. This circuit is designed to accommodate the low sampling rate of the Fusion device. Experimental results showed that the Fusion device allows the measurement of the energy of the target device at a minimum rate of 15 µs. The energy measurement circuit is implemented using the 65 nm CMOS technology. Simulation results showed that this circuit provides 91%~97% average energy measurement accuracy.

Published
2012

Catalog

Books, media, physical & digital resources
See catalog results