?
Job Ranking and Scheduling in Utility Grids VOs
P. 285-297.
In this work, we propose approaches to creation of a ranked jobs framework within a model of cycle scheduling in virtual organizations of utility Grids with the decoupling of users from resource providers. Two methods for job selection and scheduling are proposed and compared: the first one is based on the knapsack problem solution, while the second one introduces a heuristic parameter of a job and a computational resource set “compatibility”. Along with these methods we present experimental results demonstrating the efficiency of proposed approaches and compare them with random job selection.
In book
Vol. 9251: Lecture Notes in Computer Science. , Dordrecht, L., Cham, Heidelberg, NY : Springer, 2015
Toporkov V., Anna Toporkova, Tselishchev A. et al., , in : Parallel Processing Workshops (ICPPW), 2015 44th International Conference on Parallel Processing. : Los Alamitos, Washington, Tokyo : IEEE Computer Society, 2015. P. 257-266.
In this work, we consider the problems of job flow distribution and ranked job framework forming within a model of cycle scheduling in Grid virtual organizations. The problem of job flow distribution is solved in terms of jobs and computing resource domains compatibility. A coefficient estimating such compatibility is introduced and studied experimentally. Two distribution ...
Added: July 14, 2016
Toporkov V., Toporkova Anna, Tselishchev A. et al., , in : Theory and Engineering of Complex Systems and Dependability Proceedings of the Tenth International Conference on Dependability and Complex Systems DepCoS-RELCOMEX, June 29 – July 3 2015, Brunów, Poland. Vol. 365: Advances in Intelligent Systems and Computing .: Dordrecht, L., Cham, Heidelberg, NY : Springer, 2015. P. 505-514.
In this work, we describe approaches to creation of a ranked jobs framework within the model of cycle scheduling in Grid virtual organizations with such quality of service (QoS) indicators as an average job execution time and a number of required scheduling cycles. Two methods for job selection and scheduling are proposed and compared: the ...
Added: July 10, 2015
Toporkov V., Toporkova A. S., Tselishchev A. et al., The Journal of Supercomputing 2014 Vol. 69 No. 1 P. 53-60
In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in distributed computing with non-dedicated and heterogeneous resources. A single slot is a time span that can be assigned to a task, which is a part of a job. The job launch requires a co-allocation of a specified number of slots starting ...
Added: July 8, 2014
Toporkova A. S., Емельянов Д. М., Топорков В. В., В кн. : Труды международной конференции IT+S&E’15 (Гурзуф, 22 мая-01 июня 2015 г.). Весенняя сессия. : М. : Институт новых информационных технологий, 2015. С. 17-29.
В статье предлагаются алгоритмы выбора слотов и коаллокации для параллельных заданий в распределенных вычислениях с неотчуждаемыми неоднородными ресурсами. Слот – отрезок времени, который может быть выделен задаче на соответ-ствующем ресурсе. Задача является составной частью задания. Для выполнения задания необходимо выбрать требуемое число слотов в соответствии с числом задач, составляющих задание. Предложенные алгоритмы используют альтернативные наборы ...
Added: June 1, 2015
Toporkov V., Toporkova A. S., Tselishchev A. et al., Procedia Computer Science 2014 Vol. 29 P. 831-843
In this paper, we deal with problems of efficient resource management and scheduling in utility Grids. There are global job flows from external users along with resource owners’ local tasks upon resource non-dedication condition. Competition for resource reservation between independent users, local and global job flows substantially complicates scheduling and the requirement to provide the ...
Added: February 24, 2015
Toporkov V., Anna Toporkova, Tselishchev A. et al., Procedia Computer Science 2015 Vol. 51 No. 1 P. 845-854
Distributed environments with the decoupling of users from resource providers are generally termed as utility Grids. The paper focuses on the problems of efficient job flow distribution and scheduling in virtual organizations (VOs) of utility Grids while ensuring the VO stakeholders preferences and providing dependable strategies for resources utilization. An approach based on the combination ...
Added: June 1, 2015
Toporkov V., Anna Toporkova, Tselishchev A. et al., Journal of Ambient Intelligence and Humanized Computing 2015 Vol. 6 No. 6 P. 733-740
Distributed environments with the users decoupling from resource providers are generally defined as utility Grids. This paper focuses on the problems of an efficient scheduling in virtual organizations (VOs) of utility Grids. The proposed scheduling model ensures the VO stakeholders preferences and provides strategies for effective resources utilization. An approach based on the combination of ...
Added: April 22, 2015
Toporkov V., Yemelyanov D., Anna Toporkova et al., , in : ICIT 2013.The 6th International Conference on Information Technology. Cloud Computing. May 8th-10th, 2013, Amman, Jordan, IEEE Jordan Chapter, ICIT 2013. : Jordan : IEEE Computer Society, 2013. Ch. 697. P. 1-11.
In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in distributed computing with non-dedicated resources. A single slot is a time span that can be assigned to a task, which is a part of a job. The job launch requires a co-allocation of a specified number of slots starting synchronously. The ...
Added: November 29, 2013
Toporkov V., Toporkova A. S., Tselishchev A. et al., , in : Intelligent Distributed Computing VII. Proceedings of the 7th International Symposium on Intelligent Distributed Computing - IDC 2013, Prague, Czech Republic, September 2013. Vol. 511: Studies in Computational Intelligence.: Dordrecht, L., Cham, Heidelberg, NY : Springer, 2014. P. 109-118.
In this work, we introduce heuristic slot selection and co-allocation strategies for parallel jobs in distributed computing with non-dedicated and heterogeneous resources (clusters, CPU nodes equipped with multicore processors, networks etc.). A single slot is a time span that can be assigned to a task, which is a part of a job. The job launch ...
Added: March 13, 2015
Топорков В. В., Емельянов Д. М., Toporkova A. S., В кн. : Информационные технологии в науке, образовании и управлении: Труды международной конференции IT + S&E`16 (Гурзуф, 22.05. – 01.06.2016). : М. : ИНИТ, 2016. С. 22-31.
Рассматриваются вопросы эффективной организации и поддержки вычислений в распределенных средах с неотчуждаемыми ресурсами на основе грид-технологий, облачных сервисов и платформ ...
Added: July 13, 2016
Toporkov V., Toporkova A. S., Tselishev A. et al., , in : Parallel Computing Technologies. 12th International Conference, PaCT 2013, St. Petersburg, Russia, September 30-October 4, 2013, Proceedings. Vol. 7979: Lecture Notes in Computer Science.: Berlin, Heidelberg : Springer, 2013. P. 120-134.
In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in distributed computing with non-dedicated and heterogeneous resources (clusters, CPU nodes equipped with multicore processors, networks etc.). A single slot is a time span that can be assigned to a task, which is a part of a job. The job launch requires ...
Added: December 4, 2013
Toporkov V., Yemelyanov D., Anna Toporkova, Simulation Modelling Practice and Theory 2021 Vol. 107 No. February 2021 P. 102228
Abstract
In this work, an approach for a preference-based job-flow scheduling in Grid virtual organizations is proposed and studied. Virtual organizations provide uniform rules of the resources sharing and consumption and should respect individual and common preferences of its stakeholders: users, resource providers and administrators. In most cases, a virtual organization’s stakeholders pursue contradictory market-based goals, ...
Added: December 11, 2020
Toporkov V., Yemelyanov D., Potekhin P. et al., Computing and Informatics 2015 Vol. 34 No. 1 P. 45-76
In this paper, we address problems of efficient computing in distributed systems with non-dedicated resources including utility grid. There are global job flows from external users along with resource owner's local tasks upon the resource non-dedication condition. Competition for resource reservation between independent users, local and global job flows substantially complicates scheduling and the requirement ...
Added: July 10, 2015
Toporkov V. V., Toporkova A. S., Tselishev A. undefined. et al., , in : Proceedings of the 11th International Conference on Parallel Computing Technologies. Vol. 6873.: Berlin, Heidelberg : Springer, 2011. P. 368-383.
In this paper, we present slot selection algorithms for batch scheduling in distributed computing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing approaches towards resource co-allocation and job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. A launch of a parallel ...
Added: April 20, 2012
Toporkov V., Anna Toporkova, Tselishev A. et al., , in : New Results in Dependability and Computer Systems.Proceedings of the 8th International Conference on Dependability and Complex Systems DepCos-RELCOMEX, September 9-13, 2013, Brunow, Poland. Vol. 224: Advances in Intelligent Systems and Computing.: Dordrecht, L., Cham, Heidelberg, NY : Springer, 2013. P. 459-468.
In this work, we address the problem of slot selection and co-allocation for parallel jobs in distributed computing with non-dedicated resources. A single slot is a time span that can be assigned to a task, which is a part of a job. The job launch requires a co-allocation of a specified number of slots starting ...
Added: November 29, 2013
Toporkov V. V., Toporkova A. S., Bobchenkov A. V. et al., , in : Advances in Information Technology from AI to Virtual Reality. : Amman : UbiCC Publisher, 2011. P. 2-20.
In this work, we present slot selection algorithms for job batch scheduling in distributed computing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing approaches towards resource co-allocation and parallel job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots ...
Added: April 12, 2012
Toporkov V. V., Toporkova A. S., Yemelyanov D. M. et al., , in : Dependable Computer Systems. Vol. 97.: Berlin, Heidelberg : Springer, 2011. P. 243-256.
This work presents slot selection algorithms in economic models for independent job batch scheduling in distributed computing with non-dedicated resources. Existing approaches towards resource co-allocation and multiprocessor job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requirements of necessary span, computational ...
Added: April 20, 2012
Toporkov V. V., Toporkova A. S., Tselishev A. undefined. et al., , in : Proceedings of the 2010 ACS/IEEE International Conference on Computer Systems and Applications, Hammamet, Tunisia, May 16-19th, 2010. : Los Alamitos : IEEE CS Pre, 2010. P. 18-25.
In this paper, we present an approach to scalable co-scheduling in distributed computing for complex sets of interrelated tasks(jobs). The scalability means that schedules are formed for job models with various levels of task granularity, data replication policies, and processor resource and memory can be upgraded. The necessary of guaranteed job execution at the required ...
Added: April 20, 2012
Toporkov V. V., Toporkova A. S., Bobchenkov A. V. et al., Procedia Computer Science 2011 No. 4 P. 2267-2276
In this paper presented slot selection algorithms in economic model for independent job batch scheduling in a distributed computing with non-dedicated resources. Exiting approaches towards resource co-allocation and multiprocessor job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requirements of necessary ...
Added: April 13, 2012
Toporkov V. V., Toporkova A. S., Tselishev A. undefined. et al., , in : Monographs of System Dependability. Dependability of Networks. Vol. 2.: Wrocław : Oficyna Wydawnicza Politechnki Wroclawskiej, 2010. Ch. 10. P. 143-154.
This chapter describes an economic model for independent job flow management in distributed computing environments with non-dedicated resources. The model is based on the concept of fair resource distribution between users and owners of computational nodes by means of economic mechanisms in a virtual organization. Scheduling is performed in cycles in accordance with dynamically updated ...
Added: April 20, 2012
Toporkov V., Anna Toporkova, Yemelyanov D., , in : Intelligent Distributed Computing XII. Vol. 798: Intelligent Distributed Computing XII.: Cham, Switzerland : Springer, 2018. P. 40-49.
In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in distributed computing with non-dedicated and heterogeneous resources. A single slot is a time span that can be assigned to a task, which is a part of a parallel job. The job launch requires a co-allocation of a specified number of slots ...
Added: October 26, 2018
Wrocław : Oficyna Wydawnicza Politechnki Wroclawskiej, 2010
This chapter describes an economic model for independent job flow management in distributed computing environments with non-dedicated resources. The model is based on the concept of fair resource distribution between users and owners of computational nodes by means of economic mechanisms in a virtual organization. Scheduling is performed in cycles in accordance with dynamically updated ...
Added: April 20, 2012
Топорков В. В., Емельянов Д. М., Toporkova A. S., Информационные технологии в науке, образовании и управлении 2017 № 3 С. 72-80
This paper deals with problems of scheduling in distributed environments with non-dedicated resources
in Grid. ...
Added: January 26, 2018
Toporkov V., Anna Toporkova, Tselishchev A. et al., , in : Intelligent Distributed Computing IX. Proceedings of the 9th International Symposium on Intelligent Distributed Computing – IDC'2015, Guimarães, Portugal, October 2015. Vol. 616: Studies in Computational Intelligence.: Dordrecht, L., Cham, Heidelberg, NY : Springer, 2016. P. 189-198.
In this paper, we propose a meta-data based approach for a deliberate job flow distribution in computing environments, such as utility Grids. Under condi- tions of a heterogeneous job flow composition and a variety of resource domains, we examine how different job and resource characteristics affect the efficiency of the scheduling process. Based on the ...
Added: July 13, 2016