Sciweavers

157 search results - page 21 / 32
» The Case for Fair Multiprocessor Scheduling
Sort
View
NCA
2007
IEEE
14 years 3 months ago
Improving Network Processing Concurrency using TCPServers
Exponentially growing bandwidth requirements and slowing gains in processor speeds have led to the popularity of multiprocessor architectures. Network stack parallelism is increas...
Aniruddha Bohra, Liviu Iftode
CASES
2007
ACM
14 years 1 months ago
Hierarchical coarse-grained stream compilation for software defined radio
Software Defined Radio (SDR) is an emerging embedded domain where the physical layer of wireless protocols is implemented in software rather than the traditional application speci...
Yuan Lin, Manjunath Kudlur, Scott A. Mahlke, Trevo...
EMSOFT
2011
Springer
12 years 9 months ago
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
Mohamed Bamakhrama, Todor Stefanov
ICCCN
2008
IEEE
14 years 4 months ago
p-Percent Coverage Schedule in Wireless Sensor Networks
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
Shan Gao, Xiaoming Wang, Yingshu Li
TWC
2010
13 years 4 months ago
Carrier load balancing and packet scheduling for multi-carrier systems
In this paper we focus on resource allocation for next generation wireless communication systems with aggregation of multiple Component Carriers (CCs), i.e., how to assign the CCs ...
Yuanye Wang, Klaus I. Pedersen, Troels B. Sø...