Sciweavers

409 search results - page 68 / 82
» Matching Scenarios with Timing Constraints
Sort
View
CF
2009
ACM
14 years 1 months ago
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
FOCS
1993
IEEE
14 years 29 days ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
CCS
2006
ACM
13 years 10 months ago
Dynamic rule-ordering optimization for high-speed firewall filtering
Packet filtering plays a critical role in many of the current high speed network technologies such as firewalls and IPSec devices. The optimization of firewall policies is critica...
Hazem Hamed, Ehab Al-Shaer
JPDC
2006
146views more  JPDC 2006»
13 years 8 months ago
A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
Minimization of the execution time of an iterative application in a heterogeneous parallel computing environment requires an appropriate mapping scheme for matching and scheduling...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
RIDE
1998
IEEE
14 years 1 months ago
On Periodic Resource Scheduling for Continuous Media Databases
The Enhanced Pay-Per-View (EPPV) model for providing continuous-media services associates with each continuous-media clip a display frequency that depends on the clip's popula...
Minos N. Garofalakis, Banu Özden, Abraham Sil...