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ę "Earliest Deadline First" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Simulation studies of EDF scheduler with different deadline distributions
    Autorzy:
    Janowski, R.
    Janowski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/91268.pdf
    Data publikacji:
    2017
    Wydawca:
    Warszawska Wyższa Szkoła Informatyki
    Tematy:
    Earliest Deadline First
    scheduling
    performance evaluation
    event simulation
    pierwszy termin
    harmonogramowanie
    ocena wydajności
    symulacja zdarzeń
    Opis:
    In this work we perform extensive simulation studies to evaluate the mean packet waiting time in a system composed of two queues and Earliest Deadline First scheduler with different deadline distributions. The investigation is focused on the analysis of mean packet delays when deterministic and exponentially distributed deadline values are used. Comparing the results is targeted at deciding if the analytical approach proposed in our earlier work for modelling performance of Earliest Deadline First scheduler with exponentially distributed deadline values is also suitable when deadline values are deterministic. The series of simulation tests let us conclude the conditions when both deadline distributions produce very close results thus confirming the applicability of our already published analytical approach.
    Źródło:
    Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2017, 11, 16; 29-41
    1896-396X
    2082-8349
    Pojawia się w:
    Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On EDF scheduler with the exponential deadlines
    Autorzy:
    Janowski, R.
    Janowski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/91491.pdf
    Data publikacji:
    2016
    Wydawca:
    Warszawska Wyższa Szkoła Informatyki
    Tematy:
    Earliest Deadline First
    scheduling
    performance evaluation
    Markov chains
    Opis:
    This work deals with the performance evaluation of EDF (Earliest Deadline First) packet scheduler with two classes. The primary metric of interest is the mean sojourn time for each class. The system is composed of two classes (two queues) with Poisson input to each of them, deterministic service times and exponentially distributed deadline values. The model is analysed as an embedded Markov chain at the instants of packet departures from the service. The solution i.e. the joint probability distribution of the number of packets in each queue is obtained using the matrix approach. The metrics such as the mean sojourn time or the mean number of packets in the system for each class are directly obtained from this joint probability distribution.
    Źródło:
    Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2016, 10, 15; 7-17
    1896-396X
    2082-8349
    Pojawia się w:
    Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Design and Analysis of EDF Scheduling Algorithm for a Chosen Network Traffic Problem: Implementation and Simulation Analysis
    Autorzy:
    Ighodaro, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/972895.pdf
    Data publikacji:
    2015
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    EDF (Earliest Deadline First)
    FIFO (First In Fist Out)
    QoS (Quality of Service)
    Opis:
    Workstations, CPU etc are in a period of transition, moving from a relatively slow network links and data oriented services to a high set fibre optic services and more diverse services. As such many of the hard and soft real time will not only demand high bandwidth but also a predictable and guarantee Quality of Service (QoS) along side ,which is not offered in a best effort network (BE). The provision and terms of (QoS) to real-time applications is a key issue in promising broadband packet switched networks and network of other sorts. Applications such as voice and video typically require QoS guarantees in terms of end-to-end data transfer delays. Supporting the diverse and of course, heterogeneous delay requirements of applications with widely varying characteristics requires packet scheduling schemes more sophisticated than First-In-First-Out (FIFO) at each switch in the network(2) are one of most accepted examples of such scheduling schemes. This points to the convincing need for a QoS, which apportion a high network utilization to be realized.In this paper, we focus on the EDF scheduling scheme, since it is known to provide the optimal delay performance (2), in the deterministic environment, and can for this reason be expected to perform well in the real time setting as well. The large amount of bandwidth as promised by the future network also offer the integration of real time applications, hard or soft.
    Źródło:
    Journal of Applied Computer Science Methods; 2015, 7 No. 1; 43-52
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    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ł
      Wyświetlanie 1-4 z 4

      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