Sciweavers

1257 search results - page 99 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
SPAA
2010
ACM
15 years 1 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
ISPAN
2002
IEEE
15 years 6 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
EMSOFT
2005
Springer
15 years 7 months ago
A GA-based scheduling method for FlexRay systems
An advanced communication system, the FlexRay system, has been developed for future automotive applications. It consists of time-triggered clusters, such as drive-by-wire in cars,...
Shan Ding, Naohiko Murakami, Hiroyuki Tomiyama, Hi...
JNW
2008
106views more  JNW 2008»
15 years 1 months ago
Optimization of Job Schedule Model Based on Grid Environment
CPU utilization, throughput, turnaround time, waiting time, and response time are the factor to influence system performance. Every system uses different scheduling algorithms to a...
Homer Wu, Chong-Yen Lee, Wuu-Yee Chen, Tsang-Yean ...
IPSN
2007
Springer
15 years 7 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...