A Maclaurin-series expansion approach to coupled queues with  phase-type distributed service times

Cuypere, Eline De; Turck, Koen De; Wittevrongel, Sabine; Fiems, Dieter

doi:10.4108/eai.25-10-2016.2266864

Cited by 4 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where if a=b δ(a,b)=1 ; 8 otherwise δ(a,b)=0; 9 let V be the set of target value(v ); 10 end while } In order to assign the weights, we introduce the Maclaurin series [52] for the exponential function e x with the formula (3) in this paper. Given that x =1 and divided by e on both sides of the equation ( 3), then we have the equation (4).…”

Section: Generation Of Partition Schemementioning

confidence: 99%

IDaTPA:Importance Degree Based Thread Partitioning Approach in Thread Level Speculation

Li,

Zhang,

Wang

et al. 2023

Preprint

View full text Add to dashboard Cite

As an auto-parallelization technique with the level of thread on multi-core,Thread-Level Speculation (TLS) which is also called Speculative Multithreading(SpMT), partitions programs into multiple threads and speculatively executesthem under conditions of ambiguous data and control dependence. Thread par-titioning approach plays a key role to the performance enhancement in TLS.The existing heuristic rules-based approach (HR-based approach) which is anone-size-fits-all strategy, can not guarantee to achieve the optimal thread parti-tioning. In this paper, an importance degree based thread partitioning approach(IDaTPA) is proposed to realize the partition of irregular programs into mul-tithreads. IDaTPA implements biasing partitioning for every procedure with amachine learning method. It mainly includes: constructing sample set, expres-sion of knowledge, calculation of similarity, prediction model and the partitionof the irregular programs is performed by the prediction model. Using IDaTPA,the subprocedures in unseen irregular programs can obtain their optimal parti-tion. On a generic SpMT processor (called Prophet) to perform the performanceevaluation for multithreaded programs, the IDaTPA is evaluated and averagelydelivers a speedup of 1.80 upon a 4-core processor. Furthermore, in order toobtain the portability evaluation of IDaTPA, we port IDaTPA to 8-core processorand obtain a speedup of 2.82 on average. Experiment results show that IDaTPAobtains a significant speedup increasement and Olden benchmarks respectively deliver a 5.75% performance improvement on 4-core and a 6.32% performanceimprovement on 8-core, and SPEC2020 benchmarks obtain a 38.20% performanceimprovement than the conventional HR-based approach.

show abstract

Section: Generation Of Partition Schemementioning

confidence: 99%

IDaTPA:Importance Degree Based Thread Partitioning Approach in Thread Level Speculation

Li,

Zhang,

Wang

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…This modification considerably complicates performance assessments, as the corresponding stochastic model now consists of two coupled 'queues': a decoupling inventory and an order backlog. See, e.g., [27][28][29][30] for other applications of coupled queueing systems and [31][32][33][34] for Markovian systems that include both queueing and inventory management. The performance of this hybrid MTS/MTO system is assessed when the same production capacity is used for MTS and MTO.…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis of Hybrid MTS/MTO Systems with Stochastic Demand and Production

et al. 2020

Self Cite

View full text Add to dashboard Cite

We present a comprehensive numerical approach with reasonably light complexity in terms of implementation and computation for assessing the performance of hybrid make-to-stock (MTS)/make-to-order (MTO) systems. In such hybrid systems, semi-finished products are produced up front and stored in a decoupling inventory. When an order arrives, the products are completed and possibly customised. We study this system in a stochastic setting: demand and production are modelled by random processes. In particular, our model includes two coupled Markovian queues: one queue represents the decoupling inventory and the other the order backlog. These queues are coupled as order processing can only occur when both queues are non-empty. We rely on matrix analytic techniques to study the performance of the MTO/MTS system under non-restrictive stochastic assumptions. In particular, we allow for arrival correlation and non-exponential setup and MTS and MTO processing times, while the hybrid MTS/MTO system is managed by an (s,S)-type threshold policy that governs switching from MTO to MTS and back. By some numerical examples, we assess the impact of inventory control, irregular order arrivals, setup and order processing times on inventory levels and lead times.

show abstract

IDaTPA: importance degree based thread partitioning approach in thread level speculation

Yuxiang,

Zhiyong,

Xinyong

et al. 2024

Discov Computing

View full text Add to dashboard Cite

As an auto-parallelization technique with the level of thread on multi-core, Thread-Level Speculation (TLS) which is also called Speculative Multithreading (SpMT), partitions programs into multiple threads and speculatively executes them under conditions of ambiguous data and control dependence. Thread partitioning approach plays a key role to the performance enhancement in TLS. The existing heuristic rules-based approach (HR-based approach) which is an one-size-fits-all strategy, can not guarantee to achieve the satisfied thread partitioning. In this paper, an importance degree based thread partitioning approach (IDaTPA) is proposed to realize the partition of irregular programs into multithreads. IDaTPA implements biasing partitioning for every procedure with a machine learning method. It mainly includes: constructing sample set, expression of knowledge, calculation of similarity, prediction model and the partition of the irregular programs is performed by the prediction model. Using IDaTPA, the subprocedures in unseen irregular programs can obtain their satisfied partition. On a generic SpMT processor (called Prophet) to perform the performance evaluation for multithreaded programs, the IDaTPA is evaluated and averagely delivers a speedup of 1.80 upon a 4-core processor. Furthermore, in order to obtain the portability evaluation of IDaTPA, we port IDaTPA to 8-core processor and obtain a speedup of 2.82 on average. Experiment results show that IDaTPA obtains a significant speedup increasement and Olden benchmarks respectively deliver a 5.75% performance improvement on 4-core and a 6.32% performance improvement on 8-core, and SPEC2020 benchmarks obtain a 38.20% performance improvement than the conventional HR-based approach.

show abstract

A Maclaurin-series expansion approach to coupled queues with phase-type distributed service times

Cited by 4 publications

References 18 publications

IDaTPA:Importance Degree Based Thread Partitioning Approach in Thread Level Speculation

IDaTPA:Importance Degree Based Thread Partitioning Approach in Thread Level Speculation

Performance Analysis of Hybrid MTS/MTO Systems with Stochastic Demand and Production

IDaTPA: importance degree based thread partitioning approach in thread level speculation

Contact Info

Product

Resources

About