Sciweavers

511 search results - page 92 / 103
» Lower bounds for distributed markov chain problems
Sort
View
MST
2000
57views more  MST 2000»
13 years 7 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
PLDI
2004
ACM
14 years 1 months ago
Balancing register allocation across threads for a multithreaded network processor
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
Xiaotong Zhuang, Santosh Pande
ICPP
2003
IEEE
14 years 1 months ago
Quorum-Based Asynchronous Power-Saving Protocols for IEEE 802.11 Ad Hoc Networks
This paper investigates the power mode management problem for an IEEE 802.11-based mobile ad hoc network (MANET) that allows mobile hosts to tune to the power-saving (PS) mode. The...
Jehn-Ruey Jiang, Yu-Chee Tseng, Chih-Shun Hsu, Ten...
SPAA
2005
ACM
14 years 1 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
CODES
2008
IEEE
14 years 2 months ago
Online adaptive utilization control for real-time embedded multiprocessor systems
To provide Quality of Service (QoS) guarantees in open and unpredictable environments, the utilization control problem is defined to keep the processor utilization at the schedula...
Jianguo Yao, Xue Liu, Mingxuan Yuan, Zonghua Gu