Involving memory resource consideration into workload distribution for software dsm systems

2004 ◽  
Author(s):  
Yen-Tso Liu ◽  
Tyng-Yeu Liang ◽  
Zhe-Hung Kuo ◽  
C. Shich
Keyword(s):  
Software Dsm ◽  
Workload Distribution ◽  
Memory Resource

Adapting workload distribution on software DSM clusters

2006 ◽  
Vol 36 (11-12) ◽  
pp. 1133-1155 ◽  
Author(s):  
Yen-Tso Liu ◽  
Tyng-Yeu Liang ◽  
Ce-Kuen Shieh
Keyword(s):  
Software Dsm ◽  
Workload Distribution

A reduced-peak equivalence for queues with a mixture of light-tailed and heavy-tailed input flows

2003 ◽  
Vol 35 (03) ◽  
pp. 793-805 ◽  
Author(s):  
Sem Borst ◽  
Bert Zwart
Keyword(s):  
Service Rate ◽  
Opposite Case ◽  
Peak Rate ◽  
Workload Distribution ◽  
The Mean ◽  
Heavy Tailed ◽  
Insight Into

We determine the exact large-buffer asymptotics for a mixture of light-tailed and heavy-tailed input flows. Earlier studies have found a ‘reduced-load equivalence’ in situations where the peak rate of the heavy-tailed flows plus the mean rate of the light-tailed flows is larger than the service rate. In that case, the workload is asymptotically equivalent to that in a reduced system, which consists of a certain ‘dominant’ subset of the heavy-tailed flows, with the service rate reduced by the mean rate of all other flows. In the present paper, we focus on the opposite case where the peak rate of the heavy-tailed flows plus the mean rate of the light-tailed flows is smaller than the service rate. Under mild assumptions, we prove that the workload distribution is asymptotically equivalent to that in a somewhat ‘dual’ reduced system, multiplied by a certain prefactor. The reduced system now consists of only the light-tailed flows, with the service rate reduced by the peak rate of the heavy-tailed flows. The prefactor represents the probability that the heavy-tailed flows have sent at their peak rate for more than a certain amount of time, which may be interpreted as the ‘time to overflow’ for the light-tailed flows in the reduced system. The results provide crucial insight into the typical overflow scenario.

Data and Workload Distribution in a Multithreaded Architecture

1997 ◽  
Vol 40 (2) ◽  
pp. 256-264 ◽  
Author(s):  
Andrew Sohn ◽  
Mitsuhisa Sato ◽  
Namhoon Yoo ◽  
Jean-Luc Gaudiot
Keyword(s):  
Workload Distribution ◽  
Multithreaded Architecture

scholarly journals Ethernet evaluation in data distribution traffic for the LHCb filtering farm at CERN

2021 ◽  
Vol 251 ◽  
pp. 04001
Author(s):  
Rafał Dominik Krawczyk ◽  
Flavio Pisani ◽  
Tommaso Colombo ◽  
Markus Frank ◽  
Niko Neufeld
Keyword(s):  
High Throughput ◽  
Essential Feature ◽  
Stress Test ◽  
Direct Memory Access ◽  
Control Algorithms ◽  
Performance Tests ◽  
Event Distribution ◽  
Overall Evaluation ◽  
Workload Distribution ◽  
Performance Results

This paper evaluates the real-time distribution of data over Ethernet for the upgraded LHCb data acquisition cluster at CERN. The system commissioning ends in 2021 and its total estimated input throughput is 32 Terabits per second. After the events are assembled, they must be distributed for further data selection to the filtering farm of the online trigger. High-throughput and very low overhead transmissions will be an essential feature of such a system. In this work RoCE (Remote Direct Memory Access over Converged Ethernet) high-throughput Ethernet protocol and Ethernet flow control algorithms have been used to implement lossless event distribution. To generate LHCb-like traffic, a custom benchmark has been implemented. It was used to stress-test the selected Ethernet networks and to check resilience to uneven workload distribution. Performance tests were made with selected evaluation clusters. 100 Gb/s and 25 Gb/s links were used. Performance results and overall evaluation of this Ethernet-based approach are discussed.

Sign in / Sign up

Export Citation Format

Share Document