Sciweavers

356 search results - page 19 / 72
» Parallelizing time with polynomial circuits
Sort
View
ICPP
2006
IEEE
14 years 1 months ago
Performance Modeling based on Multidimensional Surface Learning for Performance Predictions of Parallel Applications in Non-Dedi
Modeling the performance behavior of parallel applications to predict the execution times of the applications for larger problem sizes and number of processors has been an active ...
Jay Yagnik, H. A. Sanjay, Sathish S. Vadhiyar
AIPS
2011
12 years 11 months ago
A Polynomial All Outcome Determinization for Probabilistic Planning
Most predominant approaches in probabilistic planning utilize techniques from the more thoroughly investigated field of classical planning by determinizing the problem at hand. I...
Thomas Keller, Patrick Eyerich
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 2 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
IPPS
2007
IEEE
14 years 2 months ago
Constant Time Simulation of an R-Mesh on an LR-Mesh
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...
Carlos Alberto Córdova-Flores, José ...
LATA
2009
Springer
14 years 15 days ago
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
Dana Pardubská, Martin Plátek, Fried...