Sciweavers

111 search results - page 15 / 23
» Feasibility of QoS for SMT
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
ICALP
2009
Springer
14 years 2 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
COMCOM
2004
89views more  COMCOM 2004»
13 years 7 months ago
QROUTE: an QoS-guaranteed multicast routing
In this paper, we propose QROUTE, an integrated framework for QoS-guaranteed multicast routing, in which a feasible multicast tree meeting multiple QoS constraints can be construc...
Jinquan Dai, Touchai Angchuan, Hung Keng Pung
INFOCOM
2007
IEEE
14 years 1 months ago
VoIP on Wireless Meshes: Models, Algorithms and Evaluation
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...
Anand Kashyap, Samrat Ganguly, Samir R. Das, Suman...
NFM
2011
242views Formal Methods» more  NFM 2011»
13 years 2 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler