International Journal Of Mathematics And Computer Research

Efficient Workflow Scheduling for Minimizing Data Transfers and Enhancing Resource Utilization in Cloud IaaS Platforms

2024-11-04T09:46:28+00:00

Cloud IaaS platforms readily provide access to homogeneous multi-core machines, whether they are physical ("bare metal") or virtual machines. Each of these machines can be equipped with high-performance SSD disks, enabling the distribution of workflow-generated files across multiple machines, which helps minimize the overhead associated with data transfers. In this paper, we propose a scheduling algorithm called SMDT-ERU (Scheduling for Minimizing Data Transfer - Enhancing Resource Utilization), designed to reduce the makespan of data-intensive workflows by minimizing data transfers between dependent tasks over the network. Intermediate files generated by tasks are stored locally on the disk of the machine where the tasks are executed.

Through experimentation, we confirm that increasing the number of cores per machine reduces the additional costs caused by network data transfers. Real-world workflow experiments demonstrate the advantages of the proposed algorithm. Our data-driven scheduling approach significantly reduces execution time and the volume of data transferred over the network, outperforming one of the leading state-of-the-art algorithms, which we have adapted to fit our assumptions.

Transient Phenomena of Inviscid Accretion Gasradiation Slim Disc in A Gravitational Potential after Adiabatic Perturbations of the Velocities

2024-11-09T07:11:58+00:00

The formalisms for the analysis of the dynamics of slim inviscid accretion discs in a (also, non-Newtonian) gravitational potential are here developped; the role of the horizontal pressure and that of the entropy gradients are to be characterised. The adiabatic perturbations of the velocity are studied: the paradigms of the Lagrangian perturbations of the velocity are implemented.

The perturbations of the slim disc is studied in the Lagrangean formalism of adiabatic perturbations of the velocities. The new conditions on the Eulerian variation of the gravitational potential are outlined. The equations of the transient phenomena are written.

Implementation of First Passage Time Method as a Warning System to Measure the Probability of Default in Bond

2024-11-13T09:31:55+00:00

Within the rise of bond investors, an in-depth analysis of risk in bond investment will be continually needed. A lot of research mostly overviewed how a bond acts in the maturity date, while the First Passage Time is developed from the Merton Model, which helps to see credit risk from the issuing date to the maturity date. The First Passage Time Method lets us know when the model hits a certain point we call a Barrier value as the lower benchmark for the first time. It initiates a better understanding of a bond, as it does not only analyze a bond in its maturity date but also during the ongoing period. This method is applied in the Commonwealth Bank Bond I 2020, using company asset data from September 2020 to February 2023. According to R Programming output, if the barrier value is 75% of the total face value, the probability of default is 0.00003145407% with the market value of equity of IDR 21,991,492,000,000. This method will help us see a deeper view of the bond as we can set the Barrier and find whether our bond is “risky” enough, implying that investor losses will not exceed 5,06% of the initial investment within one week.

K - Power-3 Heronian Mean Labeling of Graphs

2024-11-20T08:30:37+00:00

We describe a function as – Power 3. If constitute both the induced edge labelling and take be an injective function and express it as, then a graph's Heronian Mean Labelling with p nodes and q lines is

or with distinct edge labels. In this manuscript we have proved the – Power -3 Mean labeling behaviour of Path, Twig Graph, Triangular ladder . We have also investigated - Super power -3 Heronian Mean labelling of graghs. Also, we prove that is not – Power - 3 Heronian Mean graph and - Super power -3 Heronian Mean labelling of Snake related graphs like triangular, alternative triangular and double triangular snake graphs.

Parallel Sorting of Randomly Generated Grid Jobs on a Single-Processor System

2024-11-20T15:57:06+00:00

Improvements in computer technologies continue to shape the presence and the future of modernization, driven by the need for faster and more efficient processing, most chip manufacturers have abandoned the single-processor system and turned attention to other hardware technologies like the multicore system. However, should the baby (single-processor system) be thrown away with the bathwater? Parallelization which defines the era of the multicore if properly exploited on single-processor systems can improve performance. This work exploits thread-level parallelism on the single processor system. This work uses thread-level parallelism to sort randomly generated grid jobs. The method randomly generates grid jobs which are then sorted into groups based on the computing requirements of the job. Using fuzzy rules, the sorting is done with a range of threads from one to eight in steps of two. For each set of sorting, the time of completion is recorded. The analysis shows that increases in the thread improve performance on the single processor system. However, as the number of jobs increases, the execution time also increases for all threads – indicating a general performance decline. The analysis also showed a steady improvement in performance as the number of threads increased from one to two and between two and four threads. However, the improvement leveled off at four threads and six threads and degraded between six threads and eight threads. This indicates that as the number of threads increases, the single processor system poses a bottleneck to performance due to context switches and other overheads. We therefore recommend that for thread-level parallelization on the single-processor systems, the number of threads should not be more than four.