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ę "FIFO" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    Second order approximation for the customer time in queue distribution under the FIFO service discipline
    Autorzy:
    Kruk, Łukasz
    Lehoczky, John
    Shreve, Steven
    Powiązania:
    https://bibliotekanauki.pl/articles/764153.pdf
    Data publikacji:
    2003
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2003, 1, 1
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An Universal USB 3.0 FIFO Interface For Data Acquisition
    Autorzy:
    Mroczek, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/114677.pdf
    Data publikacji:
    2016
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    data acquisition
    USB 3.0
    SuperSpeed
    FPGA
    hardware interface
    Opis:
    In this paper, an USB – DAQ interface unit that allows connecting data acquisition (DAQ) application to USB is presented. The unit contains two main components: USB to FIFO IC controller and application controller, designed as VHDL core for FPGA. DAQ logic can be connected to USB through simple I/O and streaming interfaces, thus development time of user application can be reduced. The design was tested with high-speed and SuperSpeed FTDI and Cypress USB – FIFO controllers.
    Źródło:
    Measurement Automation Monitoring; 2016, 62, 12; 434-438
    2450-2855
    Pojawia się w:
    Measurement Automation Monitoring
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The effectiveness of the implemented inventory management method - case study of a manufacturing company
    Autorzy:
    Skalik-Lubieniecka, Paulina
    Powiązania:
    https://bibliotekanauki.pl/articles/2137100.pdf
    Data publikacji:
    2022-10-29
    Wydawca:
    Międzynarodowa Wyższa Szkoła Logistyki i Transportu
    Tematy:
    Inventory management
    warehouse
    logistics
    FIFO
    LIFO
    Opis:
    One of the basic factors influencing the functioning of production enterprises is the correct inventory management. There are many methods that have been analysed and improved in recent years, but they often differ from company practices. In addition, technological development that allows for production support forces enterprises to take specific actions in the area of warehouses and inventory management. The article presents considerations on selected aspects of inventory management and analyses this element in a selected company. An analysis of the purchases of strategic raw materials in the last months in connection with the invasion of Ukraine and the reduced availability of production materials was also presented.
    Źródło:
    Logistics and Transport; 2022, 55-56, 3-4; 103-118
    1734-2015
    Pojawia się w:
    Logistics and Transport
    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ł:
    The SEKO assignment : efficient and fair assignment of students to multiple seminars
    Autorzy:
    Hoßfeld, Tobias
    Powiązania:
    https://bibliotekanauki.pl/articles/27315331.pdf
    Data publikacji:
    2023
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    assignment problem
    limited capacity
    utilization
    at least on seminar ratio
    ALOS ratio
    fairness
    integer linear programming
    ILP
    first-in first-out assignment
    FIFO assignment
    random selection using key objectives
    SEKO
    Opis:
    Seminars are offered to students for education in various disciplines. The seminars may be limited in terms of the maximum number of participants, e.g., to have lively interactions. Due to capacity limitations, those seminars are often offered several times to serve the students’ demands. Still, some seminars are more popular than others and it may not be possible to grant access to all interested students due to capacity limitations. In this paper, a simple, but efficient random selection using key objectives (SEKO) assignment strategy is proposed which achieves the following goals: (i) efficiency by utilizing all available seminar places, (ii) satisfying all students by trying to assign at least one seminar to each student, and (iii) fairness by considering the number of assigned seminars per student. We formulate various theoretical optimization models using integer linear programming (ILP) and compare their solutions to the SEKO assignment based on a real-world data set. The real-world data set is also used as the basis for generating large data sets to investigate the scalability in terms of demand and number of seminars. Furthermore, the first-in first-out (FIFO) assignment, as a typical implementation of fair assignments in practice, is compared to SEKO in terms of utilization and fairness. The results show that the FIFO assignment suffers in realworld situations regarding fairness, while the SEKO assignment is close to the optimum and scales regarding computational time in contrast to the ILP.
    Źródło:
    Operations Research and Decisions; 2023, 33, 3; 1--25
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of Markov HM-Queueing Networks with FIFO discipline at the transient regime and its application
    Autorzy:
    Matalytski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/122796.pdf
    Data publikacji:
    2015
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    HM queueing network
    closed and open queueing network
    same types of customers and different types of customers
    many-server queues
    mean number of customers
    Opis:
    In the paper Markov Queueing Networks (QN) are considered with the same types and different types of customers and incomes, FIFO discipline, which are probabilistic models of different Information Nets and Systems (INS). The incomes from the state transition of the network depend on servicing times of customers in the Queueing Systems (QS). The purpose of the research are design and development of methods and techniques of finding the probability-cost characteristics in such QN as effective analysis tools of INS. A closed Markov HM-network with the same types of customers has been investigated. Approximate expressions for the expected incomes of the QS were obtained. The method of finding the mean number of the customers was proposed. The analysis of an open HM-network with different types of customers and many-server queues has been carried out in the second part of the paper. Customers during the transition between QS can change its type. Approximate expressions for the expected incomes of the QS for each type of customer have been also obtained. A method for finding the mean number of servicing lines was described.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2015, 14, 3; 65-77
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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