Providing QoS with the Deficit Table Scheduler

Martinez-Morais, R.; Alfaro-Cortés, Francisco J.; Sánchez, José L.

doi:10.1109/tpds.2009.75

Cited by 6 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to provide applications, flows or SLs specific QoS differences, DTable arbitration tables must be configured in a proper way. DTable scheduling mechanisms themselves do not provide QoS without applying a proper configuration methodology [19].…”

Section: Dtable Configuration Methodologymentioning

confidence: 99%

See 1 more Smart Citation

Providing quality of service in omni-path networks

et al. 2022

View full text Add to dashboard Cite

New hierarchical crossbar switch architectures, such as Omni-Path (OPA) and Cray X2, have appeared to improve packet latency, reduce overall cost and increase fault tolerance of the high-performance interconnection networks in supercomputing and data center systems. These and other interconnect technologies (Infiniband or 40/100 Gigabit Ethernet) include support to provide quality of service (QoS) to the applications. In this paper, we show how this QoS support can be enabled to achieve bandwidth and/or latency differentiation in Omni-Path interconnection networks, as a representative case of hierarchical switches. To do that, three different table-based schedulers are used. We include the description of these schedulers and a comparative study by using the results obtained when we evaluate them with Hiperion, a simulation tool that implements an OPA model.

show abstract

Section: Dtable Configuration Methodologymentioning

confidence: 99%

“…Therefore, parameters w, k and the specific MTU i assigned to each SL allow to vary the maximum and minimum bandwidth assignable to SLs without affecting the final latency [19].…”

Section: Dtable Configuration Methodologymentioning

confidence: 99%

Providing quality of service in omni-path networks

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Descriptive statistics are used to minimize the representation of cluster centroids and hence decrease communication cost. Various methods are classically known for defining inter-cluster similarity [6,12,13,14]. The Single-link method calculates the similarity of two clusters based on the two most similar points (documents) in different clusters.…”

Section: Related Workmentioning

confidence: 99%

A Novel Parallel Algorithm for Clustering Documents Based on the Hierarchical Agglomerative Approach

Aboutabl¹,

Elsayed²

2011

IJCSIT

View full text Add to dashboard Cite

As the amount of internet documents has been growing, document clustering has become practically important. This has led the interest in developing document clustering algorithms. Exploiting parallelism plays an important role in achieving fast and high quality clustering. In this paper, we propose a parallel algorithm that adopts a hierarchical document clustering approach. Our focus is to exploit the sources of parallelism to improve performance and decrease clustering time. The proposed parallel algorithm is tested using a test-bed collection of 749 documents from CACM. A multiprocessor system based on message-passing is used. Various parameters are considered for evaluating performance including average inter-cluster similarity, speedup and processors' utilization. Simulation results show that the proposed algorithm improves performance, decreases the clustering time, and increases the overall speedup while still keeping a high clustering quality. By increasing the number of processors, the clustering time decreases till a certain point where any more processors will no longer be effective. Moreover, the algorithm is applicable for different domains for other document collections.

show abstract