Sciweavers

155 search results - page 24 / 31
» On Schedulability Bounds of Static Priority Schedulers
Sort
View
FOCS
1997
IEEE
15 years 1 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
TCOM
2010
80views more  TCOM 2010»
14 years 8 months ago
A Relay Assisted Cooperative Transmission Protocol for Wireless Multiple Access Systems
Abstract—In this paper, we propose a spectrally efficient cooperative transmission protocol for multiple access scenarios. The key feature is to utilize multi-user diversity and...
Zhiguo Ding, Kin K. Leung, Dennis Goeckel, Donald ...
CC
2006
Springer
182views System Software» more  CC 2006»
15 years 1 months ago
Selective Runtime Memory Disambiguation in a Dynamic Binary Translator
Abstract. Alias analysis, traditionally performed statically, is unsuited for a dynamic binary translator (DBT) due to incomplete control-flow information and the high complexity o...
Bolei Guo, Youfeng Wu, Cheng Wang, Matthew J. Brid...
SPAA
2004
ACM
15 years 3 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén
RTSS
1998
IEEE
15 years 1 months ago
Synthesis Techniques for Low-Power Hard Real-Time Systems on Variable Voltage Processors
The energy efficiency of systems-on-a-chip can be much improved if one were to vary the supply voltage dynamically at run time. In this paper we describe the synthesis of systems-...
Inki Hong, Gang Qu, Miodrag Potkonjak, Mani B. Sri...