Sciweavers

1688 search results - page 209 / 338
» Implementing Optimizations at Decode Time
Sort
View
FCT
2001
Springer
14 years 22 days ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
FPL
2010
Springer
180views Hardware» more  FPL 2010»
13 years 6 months ago
A Karatsuba-Based Montgomery Multiplier
Abstract--Modular multiplication of long integers is an important building block for cryptographic algorithms. Although several FPGA accelerators have been proposed for large modul...
Gary Chun Tak Chow, Ken Eguro, Wayne Luk, Philip L...
DAC
2011
ACM
12 years 8 months ago
ChronOS Linux: a best-effort real-time multiprocessor Linux kernel
We present ChronOS Linux, a best-effort real-time Linux kernel for chip multiprocessors (CMPs). ChronOS addresses the intersection of three problem spaces: a) OS-support for obta...
Matthew Dellinger, Piyush Garyali, Binoy Ravindran
CODES
2007
IEEE
14 years 2 months ago
Reliable multiprocessor system-on-chip synthesis
This article presents a multiprocessor system-on-chip synthesis (MPSoC) algorithm that optimizes system mean time to failure. Given a set of directed acyclic periodic graphs of co...
Changyun Zhu, Zhenyu (Peter) Gu, Robert P. Dick, L...
SODA
2003
ACM
106views Algorithms» more  SODA 2003»
13 years 9 months ago
Maintaining all-pairs approximate shortest paths under deletion of edges
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
Surender Baswana, Ramesh Hariharan, Sandeep Sen