We present a new Fair Queuing policy adapted to low-bandwidth ows, and preventing discrepancy which is encountered under almost all of the existing Fair Queuing policies. Unlike Packet-by-packet Generalized Processor Sharing PGPS and its version Worst-case Fair, Fair Queuing WF 2 Q which eliminates discrepancy, the proposed scheduling algorithm is computationally eecient hence feasible for high...

Fair queuing is a technique that allows each ow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: speciically, the work required to process a packet in these schemes was O(log(n)), where n is the number of active ows. This is expensive at high speeds. On the other hand,...

Distributed transactional memory (TM) promises to alleviate difficulties with lock-based (distributed) synchronization and object performance bottlenecks in distributed systems. In distributed TM systems, both the management and consistency of a distributed transactional object are ensured by a cache-coherence protocol. In this paper, we formalize two classes of cache-coherence protocols: distr...

In this paper, we proposed a new multistage virtual shared memory model for cluster based parallel systems. This model can be expanded in hierarchical manner and covered many of the previous clusters of parallel system designs. Queuing theory and Jackson queuing networks are applied for constructing an analytical model. This model gives a closed-form solution for the system performance metrics,...

In our previous work, a highly scalable and faulttolerant network architecture, the Progressive Multi-hop Rotational Clustered (PMRC) structure, is proposed for constructing large-scale wireless sensor networks. Further, the overlapped scheme is proposed to solve the bottleneck problem in PMRC-based sensor networks. As buffer space is often scarce in sensor nodes, in this paper, we focus on stu...

There is a huge demand for the Internet as the number of services keeps increasing. One common service is database transaction processing. Currently most confidential information is maintained in a database, and whenever users want to access the information, the information is retrieved from the database over the network. In order to complete this transaction process successfully the network sh...

This paper describes research in and a performance comparison of the Accelerated Strategic Computing Initiative (ASCI) queuing algorithms using a newly developed simulator. The goal of this research is to develop models of the queuing systems used at the Sandia, Los Alamos, and Livermore National Laboratories (SNL, LANL, LLNL) and to study the strengths and weaknesses of the queuing algorithms....

Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was O(log(n) ), where n is the number of active flows. This is expensive at high speeds. On the other...

Distributed transactional memory (TM) promises to alleviate difficulties with lock-based (distributed) synchronization and object performance bottlenecks in distributed systems. In distributed TM systems, both the management and consistency of a distributed transactional object are ensured by a cache-coherence protocol. In this paper, we formalize two classes of cache-coherence protocols: distr...