{"title":"多处理器系统的实时调度计算","authors":"M. G. Furugyan","doi":"10.1134/s1064230724700102","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The problem of scheduling computations in a multiprocessor system is considered for the case when, at some time instants, requests for the execution of job packages with known characteristics are received. Interrupts and switching from one processor to another are allowed. In the first formulation, the composition of all complexes and the characteristics of tasks are known in advance. In the second setting, this information becomes known only at the time of each request. It is required to determine whether there is an admissible schedule for the total set of jobs and build it in the case of a positive answer. A setting is studied in which, in addition to processors, there is a nonrenewable resource. A polynomial algorithm for solving the problem is developed, based on the construction of a network flow model and the search for the maximum flow.</p>","PeriodicalId":50223,"journal":{"name":"Journal of Computer and Systems Sciences International","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scheduling Calculations for a Multiprocessor System in Real Time\",\"authors\":\"M. G. Furugyan\",\"doi\":\"10.1134/s1064230724700102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3 data-test=\\\"abstract-sub-heading\\\">Abstract</h3><p>The problem of scheduling computations in a multiprocessor system is considered for the case when, at some time instants, requests for the execution of job packages with known characteristics are received. Interrupts and switching from one processor to another are allowed. In the first formulation, the composition of all complexes and the characteristics of tasks are known in advance. In the second setting, this information becomes known only at the time of each request. It is required to determine whether there is an admissible schedule for the total set of jobs and build it in the case of a positive answer. A setting is studied in which, in addition to processors, there is a nonrenewable resource. A polynomial algorithm for solving the problem is developed, based on the construction of a network flow model and the search for the maximum flow.</p>\",\"PeriodicalId\":50223,\"journal\":{\"name\":\"Journal of Computer and Systems Sciences International\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer and Systems Sciences International\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1134/s1064230724700102\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and Systems Sciences International","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s1064230724700102","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Scheduling Calculations for a Multiprocessor System in Real Time
Abstract
The problem of scheduling computations in a multiprocessor system is considered for the case when, at some time instants, requests for the execution of job packages with known characteristics are received. Interrupts and switching from one processor to another are allowed. In the first formulation, the composition of all complexes and the characteristics of tasks are known in advance. In the second setting, this information becomes known only at the time of each request. It is required to determine whether there is an admissible schedule for the total set of jobs and build it in the case of a positive answer. A setting is studied in which, in addition to processors, there is a nonrenewable resource. A polynomial algorithm for solving the problem is developed, based on the construction of a network flow model and the search for the maximum flow.
期刊介绍：
Journal of Computer and System Sciences International is a journal published in collaboration with the Russian Academy of Sciences. It covers all areas of control theory and systems. The journal features papers on the theory and methods of control, as well as papers devoted to the study, design, modeling, development, and application of new control systems. The journal publishes papers that reflect contemporary research and development in the field of control. Particular attention is given to applications of computer methods and technologies to control theory and control engineering. The journal publishes proceedings of international scientific conferences in the form of collections of regular journal articles and reviews by top experts on topical problems of modern studies in control theory.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
