Heuristic strategies for preference-based scheduling in virtual organizations of utility grids

Toporkov, Victor V.; Toporkova, Anna S.; Tselishchev, Alexey; Yemelyanov, Dmitry; Potekhin, Petr

doi:10.1007/s12652-015-0274-y

Cited by 22 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Implementation was done using GridSim. Toporkov and Toporkova introduced a hybrid method of heuristics, backfilling and cyclic scheduling [26]. The result of various algorithms and heuristics were analyzed.…”

Section: B Global Scheduler (Gs)mentioning

confidence: 99%

See 1 more Smart Citation

Heuristic Search Based Localization in Mobile Computational Grid

Sahu

Singh

Manju³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

In recent years, the number of cell phones in society has increased drastically and they are getting popular due to their computational ability and adaptability. Resource provisioning is important, but still remains NP-hard problem in mobile computational grid (MCG). Once the jobs are assigned to the MCG, the main challenge is how to identify the correct resource according to the job's requirement and use them to execute the sub-jobs. The heuristic methods such as Min-Min, Max-Min, and HEFT can be used to select appropriate resources from the MCG that is assigned for job execution. Since the computational nodes are static and mobile in nature, the performance of such heuristics is not as expected. Such heuristics suffers from low throughput and low speedup. The process of localization is used in a wireless sensor network with good results. The proposed model uses heuristics and localization process for optimizing the quality of service parameter localization, normalized speedup, and throughput in MCG, with the concept of grid nodes available in MCG. The observation shows significant improvement in the quality of service parameter localization, normalized speedup, and throughput in MCG. The proposed model HGLA and MIN-MIN, MAX-MIN, and HEFT are compared with respect to localization, speedup, and throughput. The results reveal that the proposed model shows better performance over MIN-MIN, MAX-MIN, and HEFT.

show abstract

Section: B Global Scheduler (Gs)mentioning

confidence: 99%

“…For global search, Genetic algorithm is used. Min-Min, Max-Min, HEFT and GA local search heuristic methods are well used and the explained as baseline for comparison in most of the research paper [10], [21], [25], [26], [37], [39], [41], [42]. The experiment is done via MATLAB and grid sim.…”

Section: B Global Scheduler (Gs)mentioning

confidence: 99%

Heuristic Search Based Localization in Mobile Computational Grid

Sahu

Singh

Manju³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Finally, in Toporkov et al (2015) authors propose and analyze an interesting hybrid scheduling approach, based on a combination of cycling, back-filling and heuristic schemes, for efficient resources utilization in virtual organizations of utility grids. Different algorithms and approaches are compared, and results are provided to prove the correctness of the proposed one and justify its use in different situations.…”

mentioning

confidence: 99%

Editorial: security and reliability of critical systems

Ficco

2016

J Ambient Intell Human Comput

View full text Add to dashboard Cite

Command and control applications are a vital part of modern distributed critical systems in various application areas, such as generation and distribution of electric power, storage and distribution of gas and oil, water supplies, banking and finance, government services, traffic control, and critical infrastructures. Centralized control is being replaced by distributed and more open control systems that possess increasing levels of autonomy. Communication networks, software architectures and intelligent systems are at the core of these developments. Such systems must be able to recover from the failures and intrusion in order to maintain their functions. Therefore, achieving resilience and security in such complex, interconnected, and interdependent systems, requires an integrated approach in engineering to address of resilience considerations across all constituent systems, cyber and physical.The main purpose of this special issue is to invite researchers from academia and industry to contribute with ideas, show up problems and describe solutions regarding security and reliability of critical systems and infrastructures, particularly aiming to promote more state-of-the-art research in this area.In particular, critical infrastructures protection is a complex and delicate activity, which can impact human lives and material goods, threatened by both natural phenomena, as well as the consequences of human errors. In this direction, Choras et al. (2015) present key results of the research activity conducted in the framework of FP7 CIPRNet project. Authors show an extended analysis of services composing the decision support system for critical infrastructures protection. Specific decision makers are presented to support 'decision-making process', both in the preparedness ''cold'' phase, as well as in the crisis ''hot'' phase. Moreover, dependability evaluation is an important, mandatory step in designing and analyzing critical systems. Accurate models are required to deal with dynamic, dependent behaviors, especially in complex systems. Therefore, Distefano (2015) identifies the main dynamicdependent aspects that can affect the dependability of a critical system. Starting from the concept of dependence, author proposes an analytic formal framework for representing critical system dependability, as well as presents specific common dynamic aspects of dynamic-dependent systems.As regards security aspects, in Li et al. (2015), authors propose a novel image authentication algorithm based on trisecting the original image to generate the authentication blocks as small as possible. In this algorithm, an image is split adaptively into some authentication blocks, which are composed of a number of fine-grained basic blocks. A recursive trisection method and adjacent strategies are adopted to connect basic blocks in sequence into a link. When the watermark payload cannot be embedded into an authentication block, the algorithm tries to merge only one basic block from the blocks linked to current authentication block. Theoretical...

show abstract

Dependable and Coordinated Resources Allocation Algorithms for Distributed Computing

Toporkov

Yemelyanov

2018

Communications in Computer and Information Science

View full text Add to dashboard Cite

Heuristic strategies for preference-based scheduling in virtual organizations of utility grids

Cited by 22 publications

References 15 publications

Heuristic Search Based Localization in Mobile Computational Grid

Heuristic Search Based Localization in Mobile Computational Grid

Editorial: security and reliability of critical systems

Dependable and Coordinated Resources Allocation Algorithms for Distributed Computing

Contact Info

Product

Resources

About