scholarly journals SERVERLESS COMPUTATIONS RESOURCE SCHEDULING BASED ON DATA DEPENDENCY

2021 ◽  
pp. 37-46
Author(s):  
D. I. Kukushkin ◽  
V. A. Antonenko
Keyword(s):  
Mathematical Model ◽  
Execution Time ◽  
Fault Tolerant ◽  
Critical Path ◽  
Resource Scheduling ◽  
Multiprocessor Systems ◽  
Data Dependency ◽  
Computing Model ◽  
Distributed Computations ◽  
Three Stages

The serverless computing model is becoming quite widespread. This model allows developers to create flexible and fault tolerant applications with an attractive billing model. The increasing complexity of serverless functions has led to the necessity to use serverless workflows – serverless functions invoking other serverless functions. However, such concept imposes certain requirements on the serverless functions that make distributed computations. The overhead of transferring data between serverless functions can significantly increase the execution time of a program using this approach. One way to reduce overhead is to improve serverless scheduling techniques. This paper discusses an approach to scheduling serverless computations based on data dependency analysis. We propose to divide the problem of planning of the computation of a composite serverless function into three stages. For each stage we provide a description by a mathematical model. We carried out a review of algorithms used to schedule resources by compilers and in parallel computing in multiprocessor systems to determine the best algorithm to implement in a prototype scheduler. For each algorithm, it was specified how it could be used for resource scheduling in serverless platforms. We provide a description of the developed prototype based on the Fission serverless platform. The prototype implements the critical path heuristic. It is shown that the improvements can significantly reduce the execution time up to two times for some types of serverless functions.

scholarly journals AN EXACT SOLUTION FOR THE RESOURCE-CONSTRAINED CONSTRUCTION SCHEDULING PROBLEM

2016 ◽  
Vol 8 (2) ◽  
pp. 71-78
Author(s):  
Bartłomiej Sroka ◽  
Elżbieta Radziszewska-Zielina
Keyword(s):  
Execution Time ◽  
Critical Path ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Building Projects ◽  
Construction Scheduling ◽  
Program Sample ◽  
Resource Constrained Scheduling Problem ◽  
The Cost ◽  
Exponential Complexity

Reduced time and, by the same token, the cost of the project is a crucial factor in contemporary construction. This article presents a method for the exact optimisation of a resource-constrained scheduling problem. Based on the Critical Path Method, graph theory and linear programming, an algorithm was developed and the FROPT program was written in Matlab to minimise the execution time of the task. By using the newly-created program, sample networks were calculated and the results were compared with results obtained by using the MS Project scheduling program (using approximation algorithm). The execution time obtained by using FROPT were on average 10% shorter than those obtained using MS Project. In selected cases the improvement in execution time reached 25%. A deterministic approach to the problem may shorten planned project times and bring financial benefits. Due to the exponential complexity of the algorithm, it is most useful in solving small or highly coherent networks. The algorithm and program may result in benefits not offered by commercial software for planners of building projects.

A mathematical model to evaluate return on investment in higher education

2021 ◽  
Vol 20 (4) ◽  
pp. 772-788
Author(s):  
Valeriya S. ARTEEVA ◽  
Angi E. SKHVEDIANI
Keyword(s):  
Higher Education ◽  
Mathematical Model ◽  
Business Processes ◽  
Management Decision ◽  
Peter The Great ◽  
Organizational Competencies ◽  
Management Decision Making ◽  
Documentation Systems ◽  
Three Stages ◽  
Business Analyst

Subject. The article assesses the effectiveness of investments in higher education. Objectives. The aim is to assess the performance of investments in higher education for a Master’s student at the Peter the Great St. Petersburg Polytechnic University, in the field of Economics, Business Analyst Specialty. Methods. The methodology, presented in the study, includes three stages. The first assesses the demand for skills, the second assesses how the supply of skills match the demand, and the third – the effectiveness of investments in higher education, based on the developed mathematical model, scenario analysis, and decision tree. Results. We revealed that for a business analyst, the most important categories of skills are project management, decision-making, organizational competencies, communication, and knowledge of corporate software. The most required skills in these categories are the knowledge of business processes, project documentation, systems thinking, teamwork, communication, and well-bred speech. The analysis of correspondence between the competencies required by employers and those acquired in the training process showed that Master’s graduates meet the demand for the position of a business analyst in the labor market by 69%. Conclusions. The evaluation of the effectiveness of investment in higher education for a Master’s student of the Peter the Great St. Petersburg Polytechnic University, in the field of Economics, Business Analyst Specialty, shows that it is more profitable for a Bachelor graduate to continue studying for a Master's degree, rather than go straight to work.

An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication

2011 ◽  
Vol 3 (1) ◽  
pp. 89-97 ◽  
Author(s):  
Amrit Agrawal ◽  
Pranay Chaudhuri
Keyword(s):  
Task Scheduling ◽  
Execution Time ◽  
High Speed ◽  
Critical Path ◽  
Task Assignment ◽  
Directed Acyclic Graphs ◽  
Parallel Tasks ◽  
Schedule Length ◽  
Task Duplication ◽  
Heterogeneous Distributed Systems

Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directed-acyclic graphs (DAGs). Scheduling refers to the assignment of these parallel tasks on a set of bounded heterogeneous processors connected by high speed networks. Since task assignment is an NP-complete problem, instead of finding an exact solution, scheduling algorithms are developed based on heuristics, with the primary goal of minimizing the overall execution time of the application or schedule length. In this paper, the overall execution time (schedule length) of the tasks is reduced using task duplication on top of the Critical-Path-On-a-Processor (CPOP) algorithm.

A Model for Shortening the Length of Activities in Construction and Overhaul Planning: UPROB

2002 ◽  
Author(s):  
Niko Majdandzˇic´ ◽  
Slavko Sebastijanovic´ ◽  
Gordana Maticˇevic´ ◽  
Nebojsˇa Sebastijanovic´
Keyword(s):  
Mathematical Model ◽  
Thermal Energy ◽  
Input Data ◽  
Critical Path ◽  
Planning System ◽  
Task Completion ◽  
Assembly Lines ◽  
Total Cost ◽  
Activity Cost ◽  
Optimal Variation

This paper presents a mathematical model of the UPROB (planning system for construction and overhaul) system that was developed for tank assembly lines, construction of thermal energy structures, and for performing an overhaul in complex plants. Planning technology includes utilizing linear diagrams with a direct usage of input data from a plant’s database. A model has been developed to determine the critical path and also, to define steps for the most economical shortening of the entire plan. Several plan variations are developed (according to specified goals) and the management determines the optimal variation. After selecting a plan, it is possible to control and create work orders for individual tasks in certain activities. Task completion percentage, activity cost, and the total cost of the plan are also provided.

Sign in / Sign up

Export Citation Format

Share Document