Results 1 
5 of
5
On the Power of Bounded Concurrency I: Finite Automata
 Journal of the ACM
, 1994
"... We investigate the descriptive succinctness of three fundamental notions for modeling concurrency: nondeterminism and pure parallelism, the two facets of alternation, and bounded cooperative concurrency, whereby a system configuration consists of a bounded number of cooperating states. Our results a ..."
Abstract

Cited by 33 (8 self)
 Add to MetaCart
We investigate the descriptive succinctness of three fundamental notions for modeling concurrency: nondeterminism and pure parallelism, the two facets of alternation, and bounded cooperative concurrency, whereby a system configuration consists of a bounded number of cooperating states. Our results are couched in the general framework of finitestate automata, but hold for appropriate versions of most concurrent models of computation, such as Petri nets, statecharts or finitestate versions of concurrent programming languages. We exhibit exhaustive sets of upper and lower bounds on the relative succinctness of these features over * and ', establishing that: (1) Each of the three features represents an exponential saving in succinctness of the representa tion, in a manner that isindependent of the other two and additive with respect to them.
Hierarchical static scheduling of dataflow graphs onto multiple processors
 IEEE International Conference on Acoustics, Speech, and Signal Processing
, 1995
"... In this paper we discuss a hierarchical scheduling framework to reduce the complexity of scheduling synchronous dataflow (SDF) graphs onto multiple processors. The core of this framework is a clustering technique that reduces the number of actors before expanding the SDF graph into an directed acycl ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
(Show Context)
In this paper we discuss a hierarchical scheduling framework to reduce the complexity of scheduling synchronous dataflow (SDF) graphs onto multiple processors. The core of this framework is a clustering technique that reduces the number of actors before expanding the SDF graph into an directed acyclic graph (DAG). The internals of the clusters are then scheduled with uniprocessor SDF schedulers which can optimize for memory usage. The clustering is done in such a manner as to leave ample parallelism exposed for the multiprocessor scheduler. We illustrate this framework with a realtime example that has been constructed in Ptolemy. 1.
When is a Pair of Matrices Mortal?
, 1996
"... A set of matrices over the integers is said to be lengthkmortal (with positive integer) if the zero matrix can be expressed as a product of length of matrices in the set. The set is said to be mortal if it is lengthkmortal for some finite k. ..."
Abstract

Cited by 27 (12 self)
 Add to MetaCart
A set of matrices over the integers is said to be lengthkmortal (with positive integer) if the zero matrix can be expressed as a product of length of matrices in the set. The set is said to be mortal if it is lengthkmortal for some finite k.
Upper Bounds for the SPOT5 Daily Photograph Scheduling Problem
 In Journal of Combinatorial Optimization
, 2003
"... Abstract. This paper introduces tight upper bounds for the daily photograph scheduling problem of earth observation satellites. These bounds, which were unavailable until now, allow us to assess the quality of the heuristic solutions obtained previously. These bounds are obtained with a partitionba ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. This paper introduces tight upper bounds for the daily photograph scheduling problem of earth observation satellites. These bounds, which were unavailable until now, allow us to assess the quality of the heuristic solutions obtained previously. These bounds are obtained with a partitionbased approach following the “divide and pas conquer ” principle. Dynamic programming and tabu search are conjointly used in this approach. We present also simplexbased linear programming relaxation and a relaxed knapsack approach for the problem.