Results 1  10
of
184
Scheduling Algorithms for Inputqueued Cell Switches
, 1995
"... The algorithms described in this thesis are designed to schedule cells in a very highspeed, parallel, inputqueued crossbar switch. We present several novel scheduling algorithms that we have devised, each aims to match the set of inputs of an inputqueued switch to the set of outputs more effici ..."
Abstract

Cited by 174 (5 self)
 Add to MetaCart
efficiently, fairly and quickly than existing techniques. In Chapter 2 we present the simplest and fastest of these algorithms: SLIP  a parallel algorithm that uses rotating priority ("roundrobin") arbitration. SLIP is simple: it is readily implemented in hardware and can operate at high speed
Bounded realtime dynamic programming: RTDP with monotone upper bounds and performance guarantees
 In ICML’05
, 2005
"... MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start state to a goal, restricting computation to states relevant to this task can make much larger problems tractable. We intro ..."
Abstract

Cited by 39 (1 self)
 Add to MetaCart
on the optimal value function. The performance of Bounded RTDP is greatly aided by the introduction of a new technique to efficiently find suitable upper bounds; this technique can also be used to provide informed initialization to a wide range of other planning algorithms. 1.
Monotonic parareal control for quantum systems
 SIAMJ.Numer. Anal
"... Abstract. Following encouraging experimental results in quantum control, numerical simulations have known significant improvements through the introduction of efficient optimization algorithms. Yet, the computational cost still prevents using these procedures for highdimensional systems often pre ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Abstract. Following encouraging experimental results in quantum control, numerical simulations have known significant improvements through the introduction of efficient optimization algorithms. Yet, the computational cost still prevents using these procedures for highdimensional systems often
Perfect simulation and nonmonotone Markovian systems
 In Proceedings of the 3rd international Conference on Performance Evaluation Methodologies and Tools (ValueTools’08
, 2008
"... Perfect simulation, or coupling from the past, is an efficient technique for sampling the steady state of monotone discrete time Markov chains. Indeed, one only needs to consider two trajectories corresponding to minimal and maximal state in the system. We show here that even for nonmonotone syste ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
Perfect simulation, or coupling from the past, is an efficient technique for sampling the steady state of monotone discrete time Markov chains. Indeed, one only needs to consider two trajectories corresponding to minimal and maximal state in the system. We show here that even for nonmonotone sys
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix Mikhail J. AtaUah"
, 1990
"... We give a parallel algorithm for the problem of computing the row minima of a totally monotone twodimensional matrix. Whereas the previous best CREWPRAM algorithm for this problem ran in O(log n log log n) time with O(n / log log n) processors, our algorithm runs in O(log n) time with O(n) process ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We give a parallel algorithm for the problem of computing the row minima of a totally monotone twodimensional matrix. Whereas the previous best CREWPRAM algorithm for this problem ran in O(log n log log n) time with O(n / log log n) processors, our algorithm runs in O(log n) time with O
Efficient computation of iceberg cubes by bounding aggregate functions
 IEEE TKDE, In submission
"... Abstract—The iceberg cubing problem is to compute the multidimensional groupby partitions that satisfy given aggregation constraints. Pruning unproductive computation for iceberg cubing when nonantimonotone constraints are present is a great challenge because the aggregate functions do not increase ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
be computed from aggregates for the most specific ndimensional partitions (MSPs). The largest and smallest aggregate values computed this way become the bounds for all partitions in the cube. We provide efficient methods to compute tight bounds for base aggregate functions and, more interestingly, arithmetic
ARTICLE NO. AL960824 More Efficient Parallel Totally Monotone Matrix Searching*
, 1996
"... We give a parallel algorithm for computing all row minima in a totally monotone n � n matrix which is simpler and more work efficient than previous polylogtime algorithms. It runs in OŽ lg n lg lg n. time doing On Ž 'lg n. work on a CRCW Ž Ž. 2 PRAM, inOlg n lg lg n. time doing On Ž 'lg n ..."
Abstract
 Add to MetaCart
We give a parallel algorithm for computing all row minima in a totally monotone n � n matrix which is simpler and more work efficient than previous polylogtime algorithms. It runs in OŽ lg n lg lg n. time doing On Ž 'lg n. work on a CRCW Ž Ž. 2 PRAM, inOlg n lg lg n. time doing On Ž &apos
DeadlineMonotonic Software Scheduling for the CoSynthesis of Parallel Hard RealTime Systems
, 1995
"... This paper focuses on software scheduling in hard realtime embedded systems. It uses the deadlinemonotonic scheduling heuristics, where the analysis whether the hard realtime conditions are met, is done by a schedulability test. The test presented in this paper overcomes the problems of existing a ..."
Abstract
 Add to MetaCart
are computed automatically during the efficient analysis. 1 Introduction Recently, software synthesis becomes more and more important in the automation of embedded system design. An embedded system is a special purpose computer consisting of one or more controllers. Lowcost embedded systems can
Monotone Pieces Analysis for Qualitative Modeling
"... Abstract. It is a crucial task to build qualitative models of industrial applications for modelbased diagnosis. A Model Abstraction procedure is designed to automatically transform a quantitative model into qualitative model. If the data is monotone, the behavior can be easily abstracted using the ..."
Abstract
 Add to MetaCart
the corners of the bounding rectangle. Hence, many existing model abstraction approaches rely on monotonicity. But it is not a trivial problem to robustly detect monotone pieces from scattered data obtained by numerical simulation or experiments. This paper introduces an approach based on scale
Monotone Pieces Analysis for Qualitative Modeling
"... Abstract. It is a crucial task to build qualitative models of industrial applications for modelbased diagnosis. A Model Abstraction procedure is designed to automatically transform a quantitative model into qualitative model. If the data is monotone, the behavior can be easily abstracted using the ..."
Abstract
 Add to MetaCart
the corners of the bounding rectangle. Hence, many existing model abstraction approaches rely on monotonicity. But it is not a trivial problem to robustly detect monotone pieces from scattered data obtained by numerical simulation or experiments. This paper introduces an approach based on scale
Results 1  10
of
184