scholarly journals Online algorithms for scheduling transactions on python software transactional memory

2019 ◽  
Vol 16 (1) ◽  
pp. 85-104 ◽  
Author(s):  
Marko Popovic ◽  
Branislav Kordic ◽  
Miroslav Popovic ◽  
Ilija Basicevic
Keyword(s):  
Theoretical Analysis ◽  
Online Algorithms ◽  
Time Complexity ◽  
Transactional Memory ◽  
Scheduling Algorithms ◽  
Software Transactional Memory ◽  
Transaction Scheduling ◽  
The Cost ◽  
Time Bounds

Designing online transaction scheduling algorithms is challenging because one needs to reconcile three opposing requirements: (i) they should be fast, (ii) they should minimize make span and maximize throughput, and (iii) they should produce conflict-free transaction schedules. In this paper we present four online transaction scheduling algorithms, namely, RR, ETLB, AC, and AAC algorithm, we prove their correctness and time bounds, and we conduct a theoretical analysis of the transaction schedules they produce, using three different workloads (RDW, CFW, and WDW). Finally, we compare various features of the four algorithms. The results are as expected, as we go from RR, over ETLB and AC, to AAC algorithms, the quality of the resulting schedules increases at the cost of increase of algorithm?s time complexity.

scholarly journals A method for estimating existence of pairwise STM transaction conflicts

2018 ◽  
Vol 232 ◽  
pp. 04037
Author(s):  
Miroslav Popovic ◽  
Branislav Kordic ◽  
Marko Popovic ◽  
Ilija Basicevic
Keyword(s):  
System Performance ◽  
Time Complexity ◽  
Scheduling Algorithms ◽  
False Positives ◽  
New Method ◽  
False Negatives ◽  
Transaction Scheduling ◽  
Data Races ◽  
Cost Of Time ◽  
The Cost

STM transaction schedulers were introduced to improve system performance. However, designing online transaction scheduling algorithms is challenging because at the same time they should: (i) introduce minimal scheduling overhead, (ii) minimize the resulting makespan, and (iii) minimize contention in the resulting schedule. In our previous work we developed the online transaction scheduler architecture and the four scheduling algorithms, named RR, ETLB, AC, and AAC (listed in increasing order of their quality), for scheduling transactions on the Python STM. Both AC and AAC use Bernstein conditions to check for pairwise data races between transactions, at the cost of time complexity that is proportional to the product of the sizes of transaction’s read and write sets, which may be significant. In this paper we propose a method for estimating existence of pairwise transaction conflicts whose time complexity is Θ(1). We validate this method by analysing the resulting transaction schedules for the three benchmark workloads, named RDW, CFW, and WDW. The result of this analysis is positive and encouraging – AAC using the new method produces the same result as when using Bernstein conditions. The limitation of the new method is that it may have false reports, both false negatives and false positives.

scholarly journals Development of technology for obtaining starch gluing modified with uzkhitan and hydrolyzed emulsion

2021 ◽  
Vol 2094 (4) ◽  
pp. 042070
Author(s):  
Salokhiddin Mardonov ◽  
Laziz Shokirov ◽  
Khakim Rakhimov
Keyword(s):  
Theoretical Analysis ◽  
Rheological Properties ◽  
Carboxymethyl Cellulose ◽  
Corn Starch ◽  
Acrylic Emulsion ◽  
Pass Through ◽  
Materials Used ◽  
The Cost

Abstract In this article, in order to reduce the consumption of starch for gluing warp threads and reduce the cost of sizing materials used in sizing and improve the quality of threads, an effective gluing composition was created based on a hydrolyzed acrylic emulsion (GAE) and uzkhitan (chitosan and carboxymethyl cellulose), that is, corn starch polymer and studied their rheological properties. In the article, the main threads passing through the gluing process and moving at a certain speed, which are then impregnated with liquid gluing. Then they pass through a nip roller and a drying drum, are subjected to friction and form a layer of a certain thickness. A theoretical analysis of the surface of the warp threads is carried out to determine the change in the diameter of the threads when a layer of a certain thickness is formed on their surface.

The Cost of Privatization in Software Transactional Memory

2013 ◽  
Vol 62 (12) ◽  
pp. 2531-2543 ◽  
Author(s):  
Hagit Attiya ◽  
Eshcar Hillel
Keyword(s):  
Transactional Memory ◽  
Software Transactional Memory ◽  
The Cost

scholarly journals The Analysis of Scheduling Algorithms in Microcellular 4G MIMO WINNER System

2009 ◽  
Vol 5 (1) ◽  
pp. 1
Author(s):  
Paweł Sroka ◽  
Zbigniew Długaszewski
Keyword(s):  
Fading Channels ◽  
System Performance ◽  
Scheduling Algorithms ◽  
Adaptive Transmission ◽  
Simple Modification ◽  
History Of ◽  
User Throughput ◽  
The Cost ◽  
Average User

In this paper impact of resource scheduling algorithms on the in the microcellular 4G environment has been analyzed. Among studied metrics were average user throughput,average cell’s capacity and the quality of provided services,which has been defined as a percentage of users achieving given data rate with defined error rate. Well known memoryless scheduling algorithms such as Round Robin, MaxSNR and Fair Rate have been compared with the algorithms proposed for fading channels in [1], namely Proportional Fair and Score Based algorithms. The latter algorithms take into account both history of the scheduled users and channel conditions. A simple modification has been proposed for all examined scheduling algorithms and its impact on the users and system performance has been analyzed. The above modification rely on a preselection of scheduled users, thus significantly reducing number of computations at the cost of some performance loss.Presented results have been obtained for both uplink anddownlink OFDMA transmission in the multipath MIMOchannels in the Metropolitan Area scenario proposed within the WINNER project. Only the frequency adaptive transmission mode has been considered.

scholarly journals Quality of Service based Task Scheduling Algorithms in Cloud Computing

2017 ◽  
Vol 7 (2) ◽  
pp. 1088 ◽  
Author(s):  
Sirisha Potluri ◽  
Katta Subba Rao
Keyword(s):  
Cloud Computing ◽  
Quality Of Service ◽  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithms ◽  
Task Time ◽  
The Cost

<p>In cloud computing resources are considered as services hence utilization of the resources in an efficient way is done by using task scheduling and load balancing. Quality of service is an important factor to measure the trustiness of the cloud. Using quality of service in task scheduling will address the problems of security in cloud computing. This paper studied quality of service based task scheduling algorithms and the parameters used for scheduling. By comparing the results the efficiency of the algorithm is measured and limitations are given. We can improve the efficiency of the quality of service based task scheduling algorithms by considering these factors arriving time of the task, time taken by the task to execute on the resource and the cost in use for  the communication.</p>

Pengaruh Kompetensi Coder terhadap Keakuratan dan Ketepatan Pengkodean Menggunakan ICD 10 di Rumah Sakit X Pekanbaru Tahun 2016

2018 ◽  
Vol 1 (1) ◽  
pp. 31-43
Author(s):  
Nur Maimun ◽  
Jihan Natassa ◽  
Wen Via Trisna ◽  
Yeye Supriatin
Keyword(s):  
Medical Record ◽  
Human Error ◽  
Medical Personnel ◽  
Quality Of Data ◽  
Accuracy And Precision ◽  
Result Show ◽  
Study Implementation ◽  
Icd 10 ◽  
The Cost

The accuracy in administering the diagnosis code was the important matter for medical recorder, quality of data was the most important thing for health information management of medical recorder. This study aims to know the coder competency for accuracy and precision of using ICD 10 at X Hospital in Pekanbaru. This study was a qualitative method with case study implementation from five informan. The result show that medical personnel (doctor) have never received a training about coding, doctors writing that hard and difficult to read, failure for making diagnoses code or procedures, doctor used an usual abbreviations that are not standard, theres still an officer who are not understand about the nomenclature and mastering anatomy phatology, facilities and infrastructure were supported for accuracy and precision of the existing code. The errors of coding always happen because there is a human error. The accuracy and precision in coding very influence against the cost of INA CBGs, medical and the committee did most of the work in the case of severity level III, while medical record had a role in monitoring or evaluation of coding implementation. If there are resumes that is not clearly case mix team check file needed medical record the result the diagnoses or coding for conformity. Keywords: coder competency, accuracy and precision of coding, ICD 10

ABOUT NECESSITY OF MATHEMATICAL MODELING OF THE BUSINESS PROCESS OF COST ESTIMATE CALCULATIONS IN THE CONSTRUCTION OF OIL AND GAS FACILITIES

2017 ◽  
pp. 139-145
Author(s):  
R. I. Hamidullin ◽  
L. B. Senkevich
Keyword(s):  
Mathematical Modeling ◽  
Quality Assessment ◽  
Business Process ◽  
Oil And Gas ◽  
Oil And Gas Industry ◽  
Gas Industry ◽  
Construction Organizations ◽  
The Cost ◽  
Cost Of Construction

A study of the quality of the development of estimate documentation on the cost of construction at all stages of the implementation of large projects in the oil and gas industry is conducted. The main problems that arise in construction organizations are indicated. The analysis of the choice of the perfect methodology of mathematical modeling of the investigated business process for improving the activity of budget calculations, conducting quality assessment of estimates and criteria for automation of design estimates is performed.

Sign in / Sign up

Export Citation Format

Share Document