In 2003 Cohn and Umans introduced a group-theoretic approach to fast matrix multiplication. This involves finding large subsets S, T and U of a group G satisfying the Triple Product Property (TPP) as a means to bound the exponent ω of the matrix multiplication. We show that S, T and U may be be assumed to contain the identity and be otherwise disjoint. We also give a much shorter proof of the u...

The present work contains the design and analysis of a statistically self-similar data structure using linear space and supporting the operations, insert, search, remove, increase-key and decrease-key for a deterministic priority queue in expected O(1) time. Extract-max runs in O(logN) time. The depth of the data structure is at most log∗N . On the highest level, each element acts as the entran...

The paper deals with a neural network controlled switch fabric with frame prioritization support. The impact of priority levels on the functionality and efficiency of this switch fabric was deeply investigated. The results of the studies related to the impact of the amount of priority levels are published in this paper. Key-Words: Hopfield neural network, switch fabric, prioritization, priority...

In this paper, we address the problem of buffer management in a DBMS when the workload consists of transactions of different priority levels. We present Priority-Hints. a new buffer management algorithm that uses hints provided by the DBMS access methods. The performance of Priority-Hints is compared to that of priority buffer management schemes introduced earlier for a variety of workloads. Ou...

This p p e r considers a nunpreemptive priority queue with two classes of customers. Customers in each priority class arrive to the system according to a Markovian arrival process (MAP). Since the MAP is weakly dense in the class of stationary point processes, it is a fairly general arrival process. The service times of custcomers in ea,ch priority class are independent and identically distribu...

The IEEE 802.11e EDCF mechanism cannot guarantee the QOS of highpriority traffic as the bandwidth consumption of the low-priority traffic increases. Also, in the presence of high priority traffic dampen link utilization of low priority traffic. To overcome these problems, we propose the Novel mechanism in our research that extends IEEE 802.11e EDCF by introducing a Super Slot and Virtual Collis...

We present the transient analysis of the system content in a two-class discrete-time M X /D/1 priority queue. In particular, we derive an expression for the generating function of the transient system contents of both classes at the beginning of slots. Performance measures are calculated from this generating function. To illustrate our approach we conclude with some examples. c © 2008 Elsevier ...

In this paper we present a scalable and recursive class of banyan switching architectures called the Shared-Tree Banyan Networks (STBN). For ATM networks STBN can be engineered between two extremes: (1) a low-cost banyan with internal and external conflicts, or (2) a high-cost conflict-free fully-connected network with multiple outlets. STBN scalability is based on: (1) scalable concentrator ba...