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ę "real time scheduling" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-12 z 12
    Tytuł:
    Using Pre-emption For Dependable Urban Vehicle Traffic
    Autorzy:
    Letia, T.
    Barbu, S.
    Dinga, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/384863.pdf
    Data publikacji:
    2009
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    urban vehicle traffic control
    real time scheduling
    traffic congestion
    real time control
    dependability
    Opis:
    A new approach for design and implementation of urban vehicle control system is proposed. The vehicle streams on lanes are considered similar with the streams of instructions in multitask programs. Real-time scheduling algorithms are used to allocate the green lights to phases. An adaptive component is used to calculate new vehicle flow parameters when a failure appears as a consequence of an accident. The real-time schedulers use the parameters to obtain new feasible resource allocations.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2009, 3, 1; 40-45
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent 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ł:
    Artificial intelligence-based decision-making algorithms, Internet of Things sensing networks, and sustainable cyber-physical management systems in big data-driven cognitive manufacturing
    Autorzy:
    Lazaroiu, George
    Androniceanu, Armenia
    Grecu, Iulia
    Grecu, Gheorghe
    Neguriță, Octav
    Powiązania:
    https://bibliotekanauki.pl/articles/19322650.pdf
    Data publikacji:
    2022
    Wydawca:
    Instytut Badań Gospodarczych
    Tematy:
    cognitive manufacturing
    Artificial Intelligence of Things
    cyber-physical system
    big data-driven deep learning
    real-time scheduling algorithm
    smart device
    sustainable product lifecycle management
    Opis:
    Research background: With increasing evidence of cognitive technologies progressively integrating themselves at all levels of the manufacturing enterprises, there is an instrumental need for comprehending how cognitive manufacturing systems can provide increased value and precision in complex operational processes. Purpose of the article: In this research, prior findings were cumulated proving that cognitive manufacturing integrates artificial intelligence-based decision-making algorithms, real-time big data analytics, sustainable industrial value creation, and digitized mass production. Methods: Throughout April and June 2022, by employing Preferred Reporting Items for Systematic Reviews and Meta-analysis (PRISMA) guidelines, a quantitative literature review of ProQuest, Scopus, and the Web of Science databases was performed, with search terms including "cognitive Industrial Internet of Things", "cognitive automation", "cognitive manufacturing systems", "cognitively-enhanced machine", "cognitive technology-driven automation", "cognitive computing technologies", and "cognitive technologies". The Systematic Review Data Repository (SRDR) was leveraged, a software program for the collecting, processing, and analysis of data for our research. The quality of the selected scholarly sources was evaluated by harnessing the Mixed Method Appraisal Tool (MMAT). AMSTAR (Assessing the Methodological Quality of Systematic Reviews) deployed artificial intelligence and intelligent workflows, and Dedoose was used for mixed methods research. VOSviewer layout algorithms and Dimensions bibliometric mapping served as data visualization tools. Findings & value added: Cognitive manufacturing systems is developed on sustainable product lifecycle management, Internet of Things-based real-time production logistics, and deep learning-assisted smart process planning, optimizing value creation capabilities and artificial intelligence-based decision-making algorithms. Subsequent interest should be oriented to how predictive maintenance can assist in cognitive manufacturing by use of artificial intelligence-based decision-making algorithms, real-time big data analytics, sustainable industrial value creation, and digitized mass production.
    Źródło:
    Oeconomia Copernicana; 2022, 13, 4; 1047-1080
    2083-1277
    Pojawia się w:
    Oeconomia Copernicana
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A New Downlink Scheduling Algorithm Proposed for Real Time Traffic in LTE System
    Autorzy:
    Mahfoudi, M.
    EL Bekkali, M.
    Najid, S.
    Mazer, S.
    EL Ghazi, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/227115.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    QoS
    real-time traffic
    scheduling strategies
    Opis:
    The Third Generation Partnership Project (3GPP) has developed a new cellular standard based packet switching allowing high data rate, 100 Mbps in Downlink and 50 Mbps in Uplink, and having the flexibility to be used in different bandwidths ranging from 1.4 MHz up to 20 MHz, this standard is termed LTE (Long Term Evolution). Radio Resource Management (RRM) procedure is one of the key design roles for improving LTE system performance, Packet scheduling is one of the RRM mechanisms and it is responsible for radio resources allocation, However, Scheduling algorithms are not defined in 3GPP specifications. Therefore, it gets a track interests for researchers. In this paper we proposed a new LTE scheduling algorithm and we compared its performances with other well known algorithms such as Proportional Fairness (PF), Modified Largest Weighted Delay First (MLWDF), and Exponential Proportional Fairness (EXPPF) in downlink direction. The simulation results shows that the proposed scheduler satisfies the quality of service (QoS) requirements of the real-time traffic in terms of packet loss ratio (PLR), average throughput and packet delay. This paper also discusses the key issues of scheduling algorithms to be considered in future traffic requirements.
    Źródło:
    International Journal of Electronics and Telecommunications; 2015, 61, 4; 409-414
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Response-time analysis of a CAN network used for supervisory control and diagnostic systems
    Autorzy:
    Werewka, J.
    Dach, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/970223.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    real-time systems
    scheduling
    distributed systems
    fieldbus
    real time analysis
    CAN
    CANopen
    Opis:
    This paper refers to construction methods of Supervisory Control and Diagnostic Systems (SCDS) based on a CAN bus. Emphasis is put on the construction of such systems. Meeting real time constraints has become one of major aspects of this elaboration. The study enumerates possibilities of using various communication mechanisms of CAN, applicable for real-time systems. Proposed solutions are especially suitable for general-purpose SCDS. Principles of real-time analysis for CAN bus based systems are discussed as well. An example of SCDS implementation for a Swiss Light Source (SLS) large scale accelerator project is given. Time analysis is made for the constructed system with real-time conditions met. Experiments performed in the SLS confirm the results of the analysis.
    Źródło:
    Control and Cybernetics; 2010, 39, 4; 1135-1157
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An Optimal Strategy of Resource Sharing in a Case of State-toggling Agents
    Autorzy:
    Wójtowicz, Tomasz
    Powiązania:
    https://bibliotekanauki.pl/articles/1373705.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
    Tematy:
    hard real-time systems
    scheduling
    shared resource
    optimization
    round-robin
    Opis:
    This paper presents an optimal scheduling solution for a case of agents sharing a resource. The amount of resource can not satisfy all agents at once and in case of runout there is a penalty. Each agent randomly toggle its state between requiring and not requiring the resource. Using the knowledge of previous state and probability of change, the scheduling algorithm is able to calculate optimal number of concuring agents for one turn, that minimizes possibility of collision yet provides as much throughput as possible. Several different scheduling strategies are tested. The optimal solution adapts automatically to the value of probability of change. Further experiments show that optimality is retained if only the average probability of a set of agents is known. A case of practical application is provided.
    Źródło:
    Schedae Informaticae; 2015, 24; 211-220
    0860-0295
    2083-8476
    Pojawia się w:
    Schedae Informaticae
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A timed Petri net framework to find optimal IRIS schedules
    Autorzy:
    Werner, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/970869.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    IRIS
    increasing reward with increasing service
    scheduling
    timed Petri nets
    critical path
    real time
    Opis:
    IRIS (increasing reward with increasing service) realtime scheduling appears frequently in real-time control applications such as heuristic control. IRIS requires not only meeting deadlines, but also finding the schedule with the best result (highest reward). In this paper, a framework is presented that uses Timed Petri nets (TPN) to transform an IRIS problem into a dynamic programming (DP) problem, allowing the application of known TPN and DP techniques. In the presented approach, an IRIS problem with tasks having discrete-time optimal parts is transformed into a (possibly unbounded) TPN. Then, the critical path problem of the TPN state graph can be tackled with DP. This approach allows for the IRIS problem multiple constraints and negative rewards.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 703-719
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
    Autorzy:
    Qureshi, M. B.
    Alrashed, S.
    Min-Allah, N.
    Kołodziej, J.
    Arabas, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/330305.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    real time system
    feasibility analysis
    fixed priority scheduling
    rate monotonic algorithm
    online scheduling
    system czasu rzeczywistego
    analiza wykonalności
    algorytm szeregowania
    Opis:
    When there is a mismatch between the cardinality of a periodic task set and the priority levels supported by the underlying hardware systems, multiple tasks are grouped into one class so as to maintain a specific level of confidence in their accuracy. However, such a transformation is achieved at the expense of the loss of schedulability of the original task set. We further investigate the aforementioned problem and report the following contributions: (i) a novel technique for mapping unlimited priority tasks into a reduced number of classes that do not violate the schedulability of the original task set and (ii) an efficient feasibility test that eliminates insufficient points during the feasibility analysis. The theoretical correctness of both contributions is checked through formal verifications. Moreover, the experimental results reveal the superiority of our work over the existing feasibility tests by reducing the number of scheduling points that are needed otherwise.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 709-722
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new sufficient schedulability analysis for hybrid scheduling
    Autorzy:
    Zhang, F.
    Zhai, Y.
    Liao, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/330353.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    scheduling algorithm
    real time system
    schedulability analysis
    preemptive scheduling
    earliest deadline first
    fixed priority
    algorytm szeregowania
    system czasu rzeczywistego
    analiza szeregowalności
    Opis:
    Earliest deadline first (EDF) and fixed priority (FP) are the most commonly used and studied scheduling algorithms for real-time systems. This paper focuses on combining the EDF and FP strategies in one system. We provide a new sufficient schedulability analysis for real-time hybrid task systems which are scheduled by EDF and FP. The proposed analysis has a polynomial time complexity and no restrictions on task parameters, where the relative deadline of each task could be less than, equal to, or greater than its period. By extensive experiments, we show that our proposed analysis significantly improves the acceptance ratio compared with the existing results of the sufficient schedulability test for hybrid scheduling systems.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 683-692
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Partition of real-time application over multicore systems
    Podział aplikacji czasu rzeczywistego na części dla ich wykonania w środowisku wielordzeniowych procesorów
    Autorzy:
    Martyna, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/282095.pdf
    Data publikacji:
    2012
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    algorytm szeregowania
    aplikacja czasu rzeczywistego
    wielordzeniowe równoległe procesory
    scheduling algorithm
    real-time application
    multicore parallel systems
    Opis:
    In this paper, we present a model of parallel execution of a real-time application in a multicore system. Currently used modern architectures provide a mechanism to prevent reciprocal inter-ference in the cause of critical activities. We propose an algorithm for obtaining the partitions of real-time applications and later for their allocation to a set of all accessible cores of a multicore pro-cessor. The algorithm takes into consideration all the constraints, such as precedence relations, timing dependencies, eta, and allows all partitions to access resources in order of their potential utility to the application. Some experimental results are provided.
    W artykule przedstawiono model równoległego wykonania aplikacji czasu rzeczywistego w wielordzeniowym systemie komputerowym. Współczesne komputery dostarczają mechanizmów dla równoległego wykonywania programów czasu rzeczywistego. Zaproponowano algorytm do przeprowadzenia podziału aplikacji czasu rzeczywistego na elementy składowe i ich alokacji w środowisku równoległych procesorów wielordzeniowych. Algorytm ten bierze pod uwagę wszystkie ograniczenia związane z wykonywaniem programu czasu rzeczywistego, w tym relację poprzedzania oraz zależności czasowe. Dzięki przedstawionemu rozwiązaniu jest możliwe pełne wykorzystanie mocy obliczeniowej wielordzeniowych procesorów dla wykonania aplikacji czasu rzeczywistego.
    Źródło:
    Automatyka / Automatics; 2012, 16, 2; 127-136
    1429-3447
    2353-0952
    Pojawia się w:
    Automatyka / Automatics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Minimization of the total completion time for asynchronous transmission in a packet data-transmission system
    Autorzy:
    Piórkowski, A.
    Werewka, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/907757.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    szeregowanie wiadomości
    kolejkowanie komunikatu
    system rozproszony
    system czasu rzeczywistego
    message scheduling
    message queuing
    distributed system
    real-time systems
    Opis:
    The minimization of the total completion time for asynchronous transmission in distributed systems is discussed. Attention is focused on the problem of message scheduling on part of the sender. Messages to be sent form a queue, and the order in which they are to be sent has to be first established. The methods of scheduling messages, which minimize the factor of the total completion time, are presented herein. The message-scheduling problem becomes considerably complicated when the stream of data transmitted between the sender and the receiver is organized into packets. A scheduling rule, according to which the shortest messages (SPT-Shortest Processing Time) are selected as the first to be sent, has been proven to be appropriate for the proposed model. A heuristic algorithm for scheduling messages with real-time constraints is proposed. The performance of the scheduling algorithm is experimentally evaluated. The results of the study show the possibility of improving the total completion time from a few to ten percent, depending on the characteristics of the sender. Thus, the practicability of the method has been proved.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 391-400
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The use of the GIS system in optimizing the costs of inspecting technical devices
    Autorzy:
    Miłek, Marzenna
    Stanik, Jerzy
    Kiedrowicz, Maciej
    Napiórkowski, Jarosław
    Powiązania:
    https://bibliotekanauki.pl/articles/31342853.pdf
    Data publikacji:
    2023
    Wydawca:
    Stowarzyszenie SILGIS
    Tematy:
    open data
    GIS
    FSM
    field service management
    work scheduling
    work dispatching
    continuous planning
    non-disruptive replanning
    real-time planning
    overconstrained planning
    otwarte dane
    zarządzanie usługami w terenie
    planowanie pracy
    przydzielanie pracy
    planowanie ciągłe
    ponowne planowanie bez zakłóceń
    planowanie w czasie rzeczywistym
    planowanie z nadmiernymi ograniczeniami
    Opis:
    Enterprises using cranes, HDS platforms, other handling equipment, or pressure equipment in their activities are subject to registration with the Office of Technical Inspection (UDT), which is obliged to conduct inspection activities on them. Inspections of technical devices are aimed at checking their technical condition. Approximately 1.3 million technical devices are currently subject to UDT supervision in Poland. Annually, UDT inspectors carry out over 1 million tests of technical devices, and the activities carried out by UDT translate into a constant reduction in the accident rate. All this takes place in conditions that require continuous work planning and scheduling. This article aims to present and discuss the use of open-source solutions for planning the work of teams carrying out inspection activities, along with the concept of their use.
    Źródło:
    GIS Odyssey Journal; 2023, 3, 2; 51-63
    2720-2682
    Pojawia się w:
    GIS Odyssey Journal
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      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