Scheduling divisible loads with the nonlinear computational complexity is a challenging task as the recursive equations are nonlinear and it is difficult to find closed-form expression for processing time and load fractions. In this study we attempt to address a divisible load scheduling problem for computational loads having second-order computational complexity in a master-slave paradigm with nonblocking mode of communication. First, we develop algebraic means of determining the optimal size of load fractions assigned to the processors in the network using a mild assumption on communication-to-computation speed ratio. We use numerical simulation to verify the closeness of the proposed solution. Like in earlier works which consider processing loads with first-order computational complexity, we study the conditions for optimal sequence and arrangements using the closed-form expression for optimal processing time. Our finding reveals that the condition for optimal sequence and arrangements for second-order computational loads are the same as that of linear computational loads. This scheduling algorithm can be used for aerospace applications such as Hough transform for image processing and pattern recognition using hidden Markov model (HMM).

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :Thermal-Aware and DVFS-Enabled Big Data Task Scheduling for Data Centers - 2018ABSTRACT:Big data has received considerable attentions lately as a result of of huge data volumes in multifarious fields. Considering
PROJECT TITLE :Stochastic Routing and Scheduling Policies for Energy Harvesting Communication Networks - 2018ABSTRACT:During this Project, we have a tendency to study the joint routing-scheduling downside in energy harvesting
PROJECT TITLE :Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching - 2018ABSTRACT:This two-half paper develops novel methodologies for using fractional programming (FP) techniques to design
PROJECT TITLE :Beam Design and User Scheduling for Nonorthogonal Multiple Access With Multiple Antennas Based on Pareto Optimality - 2018ABSTRACT:In this Project, the matter of transmit beam design and user scheduling is investigated
PROJECT TITLE :User Association and Scheduling Based on Auction in Multi-Cell MU-MIMO Systems - 2018ABSTRACT:We have a tendency to study the user association and scheduling drawback in multi-cell multi-user multiple-input multiple-output

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry