Sciweavers

2976 search results - page 122 / 596
» On the bounded integer programming
Sort
View
95
Voted
TPDS
1998
124views more  TPDS 1998»
15 years 7 days ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
ISCA
2006
IEEE
138views Hardware» more  ISCA 2006»
15 years 6 months ago
Program Demultiplexing: Data-flow based Speculative Parallelization of Methods in Sequential Programs
We present Program Demultiplexing (PD), an execution paradigm that creates concurrency in sequential programs by "demultiplexing" methods (functions or subroutines). Cal...
Saisanthosh Balakrishnan, Gurindar S. Sohi
125
Voted
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 4 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
82
Voted
ICALP
1999
Springer
15 years 4 months ago
Average-Case Complexity of Shellsort
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
Tao Jiang, Ming Li, Paul M. B. Vitányi
IEEEPACT
2000
IEEE
15 years 5 months ago
Exploring the Limits of Sub-Word Level Parallelism
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...
Kevin Scott, Jack W. Davidson