Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
910,313
Bounds on a Fair Policy with Near Optimal Performance
, 2003
"... Providing fairness and providing good response times are often viewed as conflicting goals in scheduling. Scheduling policies that provide low response times, such as Shortest Remaining Processing Time (SRPT), are sometimes not fair, while fair policies like Processor Sharing (PS) provide response t ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
policy is provably fair, as seen directly from its definition, and simulations show that FSP has a very low mean response time, close to that of SRPT in many cases [9]. Unfortunately, analyzing the mean response time of the FSP policy has proven to be difficult, and thus the queueing performance of FSP
1An Improved Layered MIMO Detection Algorithm With Near-Optimal Performance
"... This letter presents a new layered symbol detection algorithm for multiple-input multiple-output (MIMO) systems. In this scheme, the layers are divided into two groups and detected differently. For the layer with the smallest post-detection signal-to-noise ratio, an exhaustive search is performed ov ..."
Abstract
- Add to MetaCart
results show that the error rate performance of the proposed detection algorithm approaches closely that of an optimal maximum likelihood detector with no reduction in the symbol detection throughput, while its computational complexity is less than |Q | times that of V-BLAST, where |Q | is the cardinality
to�Fit�a�Variety�of�Platforms Preserving�Near-Optimal�Performance
, 2010
"... of�Parallel�Algorithms�in�OpenCL ..."
Software pipelining: An effective scheduling technique for VLIW machines
, 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract
-
Cited by 581 (3 self)
- Add to MetaCart
pipelining is that optimal performance can be achieved with compact object code. This paper extends previous results of software pipelining in two ways: First, this paper shows that by using an im-proved algorithm, near-optimal performance can be obtained without specialized hardware. Second, we propose a
A Near-Optimal Linear Crosstalk Precoder for Downstream VDSL
"... Abstract — This paper presents a linear crosstalk precoder for VDSL that has a low run-time complexity. A lower bound on the data-rate of the precoder is developed and guarantees that the precoder achieves near-optimal performance in 99 % of VDSL channels. Index Terms — Crosstalk cancellation, digit ..."
Abstract
-
Cited by 10 (4 self)
- Add to MetaCart
Abstract — This paper presents a linear crosstalk precoder for VDSL that has a low run-time complexity. A lower bound on the data-rate of the precoder is developed and guarantees that the precoder achieves near-optimal performance in 99 % of VDSL channels. Index Terms — Crosstalk cancellation
Near-optimal Rendezvous Protocols for RDMA-enabled Clusters
"... Abstract—Optimizing Message Passing Interface (MPI) pointto-point communication for large messages is of paramount importance since most communications in MPI applications are performed by such operations. Remote Direct Memory Access (RDMA) allows one-sided data transfer and provides great flexibili ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
-assisted protocol customization approach for efficient communication on RDMA-enabled clusters. We analyze existing protocols and show that they are not ideal in many situations. By leveraging the RDMA capability, we develop a set of protocols that can provide near-optimal performance for all protocol invocation
Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,
, 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract
-
Cited by 615 (2 self)
- Add to MetaCart
activation at near-optimal levels through planned stimulus change, then the theory can contribute substantially to increasing the usefulness of job rotation as a motivational technique. If, however, it turns out that there are general and inevitable decreases in activation over time regardless of how
pFabric: Minimal Near-Optimal Datacenter Transport
, 2013
"... In this paper we present pFabric, a minimalistic datacenter transport design that provides near theoretically optimal flow completion times even at the 99th percentile for short flows, while still minimizing average flow completion time for long flows. Moreover, pFabric delivers this performance wit ..."
Adapting to unknown smoothness via wavelet shrinkage
- JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
, 1995
"... We attempt to recover a function of unknown smoothness from noisy, sampled data. We introduce a procedure, SureShrink, which suppresses noise by thresholding the empirical wavelet coefficients. The thresholding is adaptive: a threshold level is assigned to each dyadic resolution level by the princip ..."
Abstract
-
Cited by 1004 (18 self)
- Add to MetaCart
also; if the unknown function has a smooth piece, the reconstruction is (essentially) as smooth as the mother wavelet will allow. The procedure is in a sense optimally smoothness-adaptive: it is near-minimax simultaneously over a whole interval of the Besov scale; the size of this interval depends
Results 1 - 10
of
910,313
