This paper presents lower bounds on the expected time for random destination routing on a mesh, valid for any routing scheme, queueing discipline and queue size. We show that the lower bounds are applicable to probabil-istic simulation of the P processor EREW PRAM with shared memory M on a P processor mesh with distributed memory M = M, M = P ; > 1, and consider two cases: where the number of p...

We describe a general technique for determining upper bounds on maximal values (or lower bounds on minimal costs) in stochastic dynamic programs. In this approach, we relax the nonanticipativity constraints that require decisions to depend only on the information available at the time a decision is made and impose a “penalty” that punishes violations of nonanticipativity. In applications, the h...

Barone and Pareto tackled the problem of socialist allocation using simple methods of the analysis of static economic equilibrium, centering on the idea that competition will force an equality between marginal cost and price. In the nineteen-twenties and thirties a group of mathematicians, statisticians, and economists, including notably Abraham Wald, John von Neumann and Oskar Morgenstern coal...

Solving fastest mixing Markov chain problem (i.e. finding transition probabilities on the edges to minimize the second largest eigenvalue modulus of the transition probability matrix) over networks with different topologies is one of the primary areas of research in the context of computer science and one of the well known networks in this issue is -partite network. Here in this work we present...

The implementation of data structures on distributed memory models such as the Bulk-Synchronous Parallel (BSP) model, rather than shared memory ones such as the PRAM, ooers a serious challenge. In this work we undertake the architecture independent study of the communication and synchronization requirements of searching ordered h-level graphs, which include most of the standard data structures....

A Bloom filter is a method for reducing the space (memory) required for representing a set by allowing a small error probability. In this paper we consider a Sliding Bloom Filter: a data structure that, given a stream of elements, supports membership queries of the set of the last n elements (a sliding window), while allowing a small error probability and a slackness parameter. The problem of s...

We consider time-processor optimal simulations of PRAM models on coated block meshes. A coated block mesh consists of-processor blocks and or p p p router blocks. The router blocks form a 2-dimensional or a 3-dimensional regular mesh, and the processor&memory blocks are located on the surface of the block mesh. As a generalization of the coated mesh, the 2-dimensional and 3-dimensional coated b...

For a proper cone K ⊂ Rn and its dual cone K∗ the complementary slackness condition xT s = 0 defines an n-dimensional manifold C(K) in the space { (x, s) | x ∈ K, s ∈ K∗ }. When K is a symmetric cone, this fact translates to a set of n linearly independent bilinear identities (optimality conditions) satisfied by every (x, s) ∈ C(K). This proves to be very useful when optimizing over such cones,...

This paper presents modeling of the transaction in the real time active database management systems. Active database with ECA rule has been found to provide an elegant framework to capture semantics of many real life applications. Real time database management system functions as a repository of data and provides storage and retrieval of data. Transactions, which update the database, are assign...

In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r -cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic to Kr , with no edges joining any two of the subgraphs) equals the minimum number of cliques of G that meet all the r -cliques of G. When r = 1, this says that chordal graphs have independence number equal to the cl...