Optimal power allocation for multiple-input multiple-output radar waveform design subject to combined peak and sum power constraints using two different criteria is addressed in this paper. The first one is by maximizing the mutual information between the random target impulse response and the reflected waveforms, and the second one is by minimizing the mean square error in estimating the targe...

Mutual exclusion is directly related to a host of selections at both system and component levels; is responsible for diversification; and gives rise to uniqueness. Mutual exclusion is also evident in modelling and flood forecasting, be it in models, software tools, data, modelling practices, flood forecasting and warning issues, and management systems. The emerging picture is that (i) diversity...

We establish trade-o s between time complexity and writeand access-contention for solutions to the mutual exclusion problem. The write-contention (accesscontention) of a concurrent program is the number of processes that may be simultaneously enabled to write (access) the same shared variable. Our notion of time complexity distinguishes between local and remote references to shared memory. We s...

The group mutual exclusion (GME) problem was introduced by Joung [6]. The GME solution allows n processes to share m mutually exclusive resources. We first present a group mutual exclusion algorithm (Algorithm GME ) for anonymous token rings. The space requirement and the size of messages of this algorithm depend only on the number of shared resources (O(logm) bits). So, the proposed algorithm ...

Recently in these pages appeared a report by Doran and Thomas [2] which gave partially simplified versions of Dekker-like solutions to the two process mutual exclusion problem with busy-waiting. This report presents a truly simple solution to the problem and attempts in a small way to dispel some myths that seem to have arisen concerning the problem. Briefly, the mutual exclusion problem for tw...

Already in 1968, E.W. Dijkstra [Dij68] proposed to apply a geometric point of view in the consideration of coordination situations in concurrency. His progress graphs were the basis of the Higher Dimensional Automata (HDA) introduced by V. Pratt[Pra91] and developed in the thesis of É. Goubault[Gou95] and in later research (cf. [FGR99]). In this abstract, we stick to a simple continuous geometr...

h-out of-k mutual exclusion is a generalization of 1mutual exclusion problem, where there are k units of shared resources and each process requests h(1 h k) units at the same time. Though k-arbiter has been shown to be a quorum-based solution to this problem, quorums in k-arbiter are much larger than these in the 1-coterie for 1-mutual exclusion. Thus, the algorithm based on k-arbiter needs man...

Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In order to enter its critical section, a node must obtain permission from a quorum of nodes. A collection of quorums is called a coterie. The most resilient coteries are called nondominated coteries. Recently, k-coteries were proposed to be used in mutual exclusion algorithms that allow up to k entr...

We present an N -process local-spin mutual exclusion algorithm, based on nonatomic reads and writes, in which each processperforms Θ(log N) remote memory references to enter and exit its critical section. This algorithm is derived from Yang andAnderson’s atomic tree-based local-spin algorithm in a way that preserves its time complexity. No atomic read/write algorithm with better asympto...