Sciweavers

1292 search results - page 196 / 259
» Revisiting the optimal scheduling problem
Sort
View
BROADNETS
2007
IEEE
16 years 7 days ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...
PARCO
1997
15 years 7 months ago
Scheduling Block-Cyclic Array Redistribution
This article is devoted to the run-time redistribution of arrays that are distributed in a blockcyclic fashion over a multidimensional processor grid. While previous studies have ...
Frederic Desprez, Jack Dongarra, Antoine Petitet, ...
IEEEPACT
2007
IEEE
16 years 6 days ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
AAAI
2008
15 years 8 months ago
Probabilistic Planning via Determinization in Hindsight
This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hind...
Sung Wook Yoon, Alan Fern, Robert Givan, Subbarao ...
JSA
2007
191views more  JSA 2007»
15 years 5 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....