Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "task scheduling" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-10 z 24
Tytuł:
Determination of a task’s validity in the marine engine room operating process with AHP method. Part. 2, Simulation results
Autorzy:
Kamiński, P.
Powiązania:
https://bibliotekanauki.pl/articles/242853.pdf
Data publikacji:
2014
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
engine room
task scheduling
hierarchy
AHP
Opis:
The frequent causes of ships’ detentions by port authorities are abnormalities of marine power plant functioning. Each extended ship lay time in port results in a waste of ship operating time thus costs rise to ship owners. This is connected with improper marine power plant management. In order to avoid it, a ship engineer should have disposal computer aided at his system supporting him in the managing of the marine power plant. Such a system can be worked out on the condition that a mathematical model, which represents the decision – making process of an engineer has been built. One element of the decision making process in managing the marine engine room is to determine how important is each of the tasks which the operators have to do. This estimation is the base to choose the most important tasks and make optimal schedule with them. The present work shows the approach to the rating method of operating tasks using AHP method. Based on practice, a hierarchic structure of factors influencing tasks validity in the engine room operating process was made. Next, a preliminary questionnaire was conducted, which put questions to the experts as chief engineers next. This enabled to define numerical values of suitable coefficients influencing on the validity of operating tasks. The equation contains this all coefficients permit to determinate numerical values of an operating task’s validity in given engine room operating processes.
Źródło:
Journal of KONES; 2014, 21, 3; 149-155
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Determination of a task’s validity in the marine engine room operating process with ahp method. Part 1, Theoretical beck round
Autorzy:
Kamiński, P
Powiązania:
https://bibliotekanauki.pl/articles/243455.pdf
Data publikacji:
2014
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
engine room
task scheduling
hierarchy
AHP
Opis:
The frequent causes of ships’ detentions by port authorities are abnormalities of marine power plant functioning. Each extended ship lay time in port results in a waste of ship operating time thus costs rise to ship owners. This is connected with improper marine power plant management. In order to avoid this, a ship engineer should has system supporting his in the managing of the marine power plant at his disposal computer aided. Such a system can be worked out on the condition that a mathematical model, which represents the decision – making process of an engineer has been built. One element of the decision making process in managing the marine engine room is to determine how important is each of the tasks which the operators have to do. This estimation is the base to choose the most important tasks and make optimal schedule with them. The present work shows the approach to the rating method of operating tasks using AHP method. Based on practice, a hierarchic structure of factors influencing a tasks validity in the engine room operating process was made. Next, a preliminary questionnaire was conducted, which put questions to the experts as chief engineers next. This enabled to define numerical values of suitable coefficients influencing on the validity of operating tasks. The equation contains this all coefficients permit to determinate numerical values of an operating task’s validity in given engine room operating processes.
Źródło:
Journal of KONES; 2014, 21, 2; 137-142
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Resource Management Techniques in Cloud-Fog for IoT and Mobile Crowdsensing Environments
Autorzy:
Ali Al-muqarm, Abbas M.
Ali Hussien, Naseer
Powiązania:
https://bibliotekanauki.pl/articles/27311923.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
IoT
Fog
Cloud
resource allocation
Task Scheduling
Opis:
The unpredictable and huge data generation nowadays by smart devices from IoT and mobile Crowd Sensing applications like (Sensors, smartphones, Wi-Fi routers) need processing power and storage. Cloud provides these capabilities to serve organizations and customers, but when using cloud appear some limitations, the most important of these limitations are Resource Allocation and Task Scheduling. The resource allocation process is a mechanism that ensures allocation virtual machine when there are multiple applications that require various resources such as CPU and I/O memory. Whereas scheduling is the process of determining the sequence in which these tasks come and depart the resources in order to maximize efficiency. In this paper we tried to highlight the most relevant difficulties that cloud computing is now facing. We presented a comprehensive review of resource allocation and scheduling techniques to overcome these limitations. Finally, the previous techniques and strategies for allocation and scheduling have been compared in a table with their drawbacks.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 2; 341--352
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new elastic scheduling task model in the node of a control and measurement system
Autorzy:
Miczulski, W.
Powroźnik, P.
Powiązania:
https://bibliotekanauki.pl/articles/220884.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
task scheduling
elastic scheduling task model
heuristic algorithms
measurement and control systems
time deadline fulfilment
Opis:
The paper presents a new elastic scheduling task model which has been used in the uniprocessor node of a control measuring system. This model allows the selection of a new set of periods for the occurrence of tasks executed in the node of a system in the case when it is necessary to perform additional aperiodic tasks or there is a need to change the time parameters of existing tasks. Selection of periods is performed by heuristic algorithms. This paper presents the results of the experimental use of an elastic scheduling model with a GRASP heuristic algorithm.
Źródło:
Metrology and Measurement Systems; 2013, 20, 1; 87-98
0860-8229
Pojawia się w:
Metrology and Measurement Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of Real-time fan scheduling in exploration-exploitation to optimize minimum function objectives
Autorzy:
Larios-Gómez, Mariano
Quintero-Flores, Perfecto M.
Anzures-García, Mario
Camacho-Hernandez, Miguel
Powiązania:
https://bibliotekanauki.pl/articles/30148244.pdf
Data publikacji:
2023
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
real-time task scheduling
genetic algorithms
concurrent computing
Opis:
This paper presents the application of a task scheduling algorithm called Fan based on artificial intelligence technique such as genetic algorithms for the problem of finding minima in objective functions, where equations are predefined to measure the return on investment. This work combines the methodologies of population exploration and exploitation. Results with good aptitudes are obtained until a better learning based on non-termination conditions is found, until the individual provides a better predisposi¬tion, adhering to the established constraints, exhausting all possible options and satisfying the stopping condition. A real-time task planning algorithm was applied based on consensus techniques. A software tool was developed, and the scheduler called FAN was adapted that contemplates the execution of periodic, aperiodic, and sporadic tasks focused on controlled environments, considering that strict time restrictions are met. In the first phase of the work, it is shown how convergence precipitates to an evolution. This is done in a few iterations. In the second stage, exploitation was improved, giving the algorithm a better performance in convergence and feasibility. As a result, a population was used and iterations were applied with a fan algorithm and better predisposition was obtained, which occurs in asynchronous processes while scheduling in real time.
Źródło:
Applied Computer Science; 2023, 19, 2; 43-54
1895-3735
2353-6977
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Lean Robotics Approach to the Scheduling of Robotic Adhesive Dispensing Process
Autorzy:
Sobaszek, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/2201877.pdf
Data publikacji:
2022
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
industrial robot
adhesive dispensing
robotic task scheduling
lean robotics
Opis:
Modern implementations of industrial robots require the use of extensive knowledge and novel concepts. To bring real benefits, robotized processes must be analysed in detail. One can now observe an increasing use of lean robotics, a concept that is primarily intended to simplify processes and eliminate inefficient activities. This paper deals with industrial robot task scheduling in the adhesive dispensing process. The first part of the paper presents the modern concept of production process robotisation and reviews the literature on industrial robot task scheduling. After that, the problem of robotic adhesive dispensing on the electronic components of a printed circuit board (PCB) is presented. Another section of the paper describes the scheduling of effective and supporting tasks of the robot in the analysed process with the use of alternative dispatching rules. The determination of a schedule that is optimal in terms of the defined objective made it possible to discuss the results and reach valid conclusions. The study has confirmed that modern concepts are useful for simplifying robotic production processes.
Źródło:
Advances in Science and Technology. Research Journal; 2022, 16, 5; 136--146
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scatter Search based algorithms for min-max regret task scheduling problems with interval uncertainty
Autorzy:
Józefczyk, J.
Siepak, M.
Powiązania:
https://bibliotekanauki.pl/articles/206069.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
task scheduling
interval uncertainty
min-max regret
branch and bound
Opis:
Uncertain versions of three task scheduling problems: P║Cmax, F2║Cmax, R║Σ Cj are investigated. Parametric uncertainty is only considered which is represented by intervals. It is assumed that values of execution times of tasks are not a priori given, and they belong to the intervals of known bounds. No distributions additionally characterizing the uncertain parameters are assumed. The regret is used as the basis for a criterion evaluating the uncertainty. In a consequence, min-max regret combinatorial problems are solved. Heuristic algorithms based on Scatter Search are proposed. They are evaluated via computational experiments and compared to a simple middle intervals heuristics and to exact solutions for small instances of the problems considered.
Źródło:
Control and Cybernetics; 2013, 42, 3; 667-698
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Teoria szeregowania zadań w analizie dotrzymania ograniczeń czasowych w systemach pomiarowo-sterujących
Task scheduling theory in time deadline analysis of measurement-control systems
Autorzy:
Michta, E.
Powiązania:
https://bibliotekanauki.pl/articles/152898.pdf
Data publikacji:
2007
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
systemy pomiarowo-sterujące
szeregowanie zadań
measurement-control systems
task scheduling
Opis:
W artykule zarysowano elementy teorii szeregowania zadań, które mogą być przydatne do analizy dotrzymania ograniczeń czasowych w systemach pomiarowo-sterujących. Zaprezentowano trzy metody szeregowania zadać ze statycznym i dynamicznym przydziałem priorytetu. Przedstawiono podstawowe zależności do sprawdzenia warunku realizowalności zadań w projektowanym systemie dla szeregowania zadań metodami RM, DM i EDF.
In this paper essentials of task scheduling theory, which can be helpful to time deadline analysis in measurement-control systems are outlined. Three task scheduling methods with static and dynamic priority assignment are presented. Basic relations to task utilization condition testing in system being design for task scheduling based on RM, DM and EDF methods are presented.
Źródło:
Pomiary Automatyka Kontrola; 2007, R. 53, nr 5, 5; 81-83
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic tile free scheduling for code with acyclic inter-tile dependence graphs
Autorzy:
Bielecki, W.
Skotnicki, P.
Powiązania:
https://bibliotekanauki.pl/articles/305409.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
optimizing compilers
tiling
task scheduling
parallel computing
dependence graph
data locality
Opis:
Free scheduling is a task ordering technique under which instructions are executed as soon as their operands become available. Coarsening the grain of computations under the free schedule, by means of using groups of loop nest statement instances (tiles) in place of single statement instances, increases the locality of data accesses and reduces the number of synchronization events, and as a consequence improves program performance. The paper presents an approach for code generation that allows for the free schedule for tiles of arbitrarily nested affine loops at run-time. The scope of the applicability of the introduced algorithms is limited to tiled loop nests whose inter-tile dependence graphs are cycle-free. The approach is based on the polyhedral model. Results of experiments with the PolyBench benchmark suite, demonstrating significant tiled code speed-up, are discussed.
Źródło:
Computer Science; 2017, 18 (2); 195-216
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Methods of the schedule matrix forming based on the modified permanent
Sposoby tworzenia matryc rozkładu w oparciu o trwałe liniowe modyfikowanie
Autorzy:
Babych, Sergiy
Turbal, Yuriy
Powiązania:
https://bibliotekanauki.pl/articles/1523244.pdf
Data publikacji:
2018
Wydawca:
Politechnika Bydgoska im. Jana i Jędrzeja Śniadeckich. Wydawnictwo PB
Tematy:
scheduling
task scheduling
configuration approach
permanent matrix
planowanie
planowanie zadań
podejście konfiguracyjne
macierz rozkładu
Opis:
In this article a technique of schedule matrices analysis for scheduling task based on the certain modifications of permanent is proposed. The proposed method of schedule construction use various configurations and representatives of their formation and algorithm based on decompozition of the permanent by line.
W artykule zaproponowano technikę analizy matryc harmonogramu dla zadania szeregowania w oparciu o pewne modyfikacje trwałe. Zaproponowana metoda budowy rozkładu wykorzystuje różne konfiguracje oraz przedstawicieli ich tworzenia i algorytmów opartych na liniowym trwałym rozkładzie.
Źródło:
Zeszyty Naukowe. Telekomunikacja i Elektronika / Uniwersytet Technologiczno-Przyrodniczy w Bydgoszczy; 2018, 21; 85-92
1899-0088
Pojawia się w:
Zeszyty Naukowe. Telekomunikacja i Elektronika / Uniwersytet Technologiczno-Przyrodniczy w Bydgoszczy
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-10 z 24

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies