Results 1  10
of
318,364
SamplePath Large Deviations for Generalized Processor Sharing Queues with Gaussian Inputs
, 2003
"... Samplepath large deviations for generalized processor sharing queues with Gaussian inputs M.R.H. Mandjes, M.J.G. van Uitert ..."
Abstract
 Add to MetaCart
Samplepath large deviations for generalized processor sharing queues with Gaussian inputs M.R.H. Mandjes, M.J.G. van Uitert
SamplePath Large Deviations
"... Samplepath large deviations for tandem and priority queues with Gaussian inputs ..."
Abstract
 Add to MetaCart
Samplepath large deviations for tandem and priority queues with Gaussian inputs
SAMPLEPATH LARGE DEVIATIONS FOR TANDEM AND PRIORITY QUEUES WITH GAUSSIAN INPUTS
, 2005
"... This paper considers Gaussian flows multiplexed in a queueing network. A single node being a useful but often incomplete setting, we examine more advanced models. We focus on a (twonode) tandem queue, fed by a large number of Gaussian inputs. With service rates and buffer sizes at both nodes scaled ..."
Abstract
 Add to MetaCart
scaled appropriately, Schilder’s samplepath largedeviations theorem can be applied to calculate the asymptotics of the overflow probability of the second queue. More specifically, we derive a lower bound on the exponential decay rate of this overflow probability and present an explicit condition
Multiscalar Processors
 In Proceedings of the 22nd Annual International Symposium on Computer Architecture
, 1995
"... Multiscalar processors use a new, aggressive implementation paradigm for extracting large quantities of instruction level parallelism from ordinary high level language programs. A single program is divided into a collection of tasks by a combination of software and hardware. The tasks are distribute ..."
Abstract

Cited by 585 (30 self)
 Add to MetaCart
Multiscalar processors use a new, aggressive implementation paradigm for extracting large quantities of instruction level parallelism from ordinary high level language programs. A single program is divided into a collection of tasks by a combination of software and hardware. The tasks
Complexityeffective superscalar processors
 In Proceedings of the 24th annual international symposium on Computer architecture
, 1997
"... The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of register renaming, instruction window wakeup and selection logic, and operand bypassing are analyzed. Each is modeled and Spice simulated f ..."
Abstract

Cited by 459 (5 self)
 Add to MetaCart
that simplifies wakeup and selection logic is proposed and discussed. This implementation puts chains of dependent instructions into queues, and issues instructions from multiple queues in parallel. Simulation shows little slowdown as compared with a completely flexible issue window when performance
Samplepath large deviations for tandem and priority queues with Gaussian inputs
"... This paper considers Gaussian flows multiplexed in a queueing network. A single node being a useful but often incomplete setting, we examine more advanced models. We focus on a (twonode) tandem queue, fed by a large number of Gaussian inputs. With service rates and bu#er sizes at both nodes scaled a ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
appropriately, Schilder's samplepath large deviations theorem can be applied to calculate the asymptotics of the overflow probability of the second queue. More specifically, we derive a lower bound on the exponential decay rate of this overflow probability and present an explicit condition for the lower
Algorithms for Scalable Synchronization on SharedMemory Multiprocessors
 ACM Transactions on Computer Systems
, 1991
"... Busywait techniques are heavily used for mutual exclusion and barrier synchronization in sharedmemory parallel programs. Unfortunately, typical implementations of busywaiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract

Cited by 567 (32 self)
 Add to MetaCart
Busywait techniques are heavily used for mutual exclusion and barrier synchronization in sharedmemory parallel programs. Unfortunately, typical implementations of busywaiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become
Image denoising using a scale mixture of Gaussians in the wavelet domain
 IEEE TRANS IMAGE PROCESSING
, 2003
"... We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian vecto ..."
Abstract

Cited by 514 (17 self)
 Add to MetaCart
We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian
A survey of generalpurpose computation on graphics hardware
, 2007
"... The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze the l ..."
Abstract

Cited by 545 (18 self)
 Add to MetaCart
the latest research in mapping generalpurpose computation to graphics hardware. We begin with the technical motivations that underlie generalpurpose computation on graphics processors (GPGPU) and describe the hardware and software developments that have led to the recent interest in this field. We then aim
Results 1  10
of
318,364