Sciweavers

1074 search results - page 157 / 215
» Parallelizing post-placement timing optimization
Sort
View
RTCSA
2003
IEEE
14 years 29 days ago
An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
Pangfeng Liu, Da-Wei Wang, Yi-Heng Guo
FCCM
2009
IEEE
165views VLSI» more  FCCM 2009»
14 years 2 months ago
Accelerating Quadrature Methods for Option Valuation
This paper presents an architecture for FPGA acceleration of quadrature methods used for pricing complex options, such as discrete barrier, Bermudan, and American options. The arc...
Anson H. T. Tse, David B. Thomas, Wayne Luk
HPCC
2005
Springer
14 years 1 months ago
Self-optimizing MPI Applications: A Simulation-Based Approach
Historically, high performance systems use schedulers and intelligent resource managers in order to optimize system usage and application performance. Most of the times, applicatio...
Emilio Mancini, Massimiliano Rak, Roberto Torella,...
STACS
2005
Springer
14 years 1 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
ICDCSW
2002
IEEE
14 years 20 days ago
Efficient Massive Sharing of Content among Peers
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request r...
Peter Triantafillou, Chryssani Xiruhaki, Manolis K...