Einloggen

Thematische Bibliographien / Calendar queue

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Calendar queue“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 11. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Calendar queue" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Calendar queue"

1

Erickson, K. Bruce. „Calendar queue expectations“. Communications in Statistics. Stochastic Models 15, Nr. 4 (Januar 1999): 617–38. http://dx.doi.org/10.1080/15326349908807555.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Brown, R. „Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem“. Communications of the ACM 31, Nr. 10 (Oktober 1988): 1220–27. http://dx.doi.org/10.1145/63039.63045.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Shehada, Mohammad K. H., und Alexandra Kondyli. „Evaluation of Ramp Metering Impacts on Travel Time Reliability and Traffic Operations through Simulation“. Journal of Advanced Transportation 2019 (20.01.2019): 1–12. http://dx.doi.org/10.1155/2019/8740158.

Der volle Inhalt der Quelle

Annotation:

Ramp metering has been found to improve traffic conditions on the freeway mainline by breaking the platoons of ramp vehicles minimizing turbulence at the merge locations. The majority of the ramp metering evaluation studies have examined traffic performance under specific demand conditions, whereas travel time reliability and variability aspects have not been adequately addressed. This paper focuses on evaluating two well-known ramp metering algorithms in terms of travel time reliability as well as other performance measures such as queue lengths, throughput, and congestion duration, looking at a wide range of traffic demands throughout a calendar year. The evaluation was done through simulating an 8-mile corridor in Kansas City, KS. The results showed localized improvements due to ramp metering at the northern section of the facility, in terms of travel time reliability, throughput, and congestion duration. It was also shown that ramp metering may cause a new (possibly “hidden”) bottleneck to occur downstream, thus diluting its overall benefits when looking at an entire freeway facility. It is further noted that although ALINEA performed better than HERO on the mainline, traffic operations on the on-ramps significantly deteriorated using isolated control.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Barreiro Megino, Fernando, Alessandro Di Girolamo, Kaushik De, Tadashi Maeno und Rodney Walker. „ATLAS Global Shares implementation in PanDA“. EPJ Web of Conferences 214 (2019): 03025. http://dx.doi.org/10.1051/epjconf/201921403025.

Der volle Inhalt der Quelle

Annotation:

PanDA (Production and Distributed Analysis) is the workload management system for ATLAS across the Worldwide LHC Computing Grid. While analysis tasks are submitted to PanDA by over a thousand users following personal schedules (e.g. PhD or conference deadlines), production campaigns are scheduled by a central Physics Coordination group based on the organization’s calendar. The Physics Coordination group needs to allocate the amount of Grid resources dedicated to each activity, in order to manage sharing of CPU resources among various parallel campaigns and to make sure that results can be achieved in time for important deadlines. While dynamic and static shares on batch systems have been around for a long time, we are trying to move away from local resource partitioning and manage shares at a global level in the PanDA system. The global solution is not straightforward, given different requirements of the activities (number of cores, memory, I/O and CPU intensity), the heterogeneity of Grid resources (site/HW capabilities, batch configuration and queue setup) and constraints on data locality. We have therefore started the Global Shares project that follows a requirements-driven multi-step execution plan, starting from definition of nestable shares, implementing share-aware job dispatch, aligning internal processes with global shares and finally implementing a pilot stream control for controlling the batch slots that keeps late binding. This contribution will explain the development work and architectural changes in PanDA to implement Global Shares, and describe how the Global Shares project has enabled the central control of resources and significantly reduced manual operations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Erickson, K. Bruce, Richard E. Ladner und Anthony Lamarca. „Optimizing static calendar queues“. ACM Transactions on Modeling and Computer Simulation 10, Nr. 3 (Juli 2000): 179–214. http://dx.doi.org/10.1145/361026.361028.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Hui, Timothy Chee-Kin, und Ian Li-Jin Thng. „FELT: A Far Future Event List Structure Optimized for Calendar Queues“. SIMULATION 78, Nr. 6 (Juni 2002): 343–61. http://dx.doi.org/10.1177/0037549702078006573.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Graboviy, Petr. „Reconstruction and modernization of industrial parks“. E3S Web of Conferences 91 (2019): 08028. http://dx.doi.org/10.1051/e3sconf/20199108028.

Der volle Inhalt der Quelle

Annotation:

The construction of the industrial park is organized in accordance with the program management method, which identifies independent startup industrial and construction complexes that determine the order in which preparatory and basic works are carried out, the calendar construction timeframe and the sequence for entering construction queues taking into account the timely supply of equipment and structures, regulatory requirements for material and labor resources, as well as means of mechanization. In the organizational form of reproduction, carried out during the reconstruction of the industrial real estate of the park, surveys are conducted on the technical condition of the structures, intrasurface and intrasite vehicles and communications, equipment and engineering networks, production conditions and construction and installation works. The article presents an example of assessing economic efficiency of the business plan for organizing the construction of an oil pipeline, which is part of an industrial (industrial) park, in the section from 1569 to 1978 km in the Mari Republic and the southern part of Kirov Oblast, with natural borders from r. Vyatka to r. Vetluga diameter of the pipeline is 1020 mm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Leone, Kelly, und Rongfang (Rachel) Liu. „Measures of Effectiveness for Passenger-Baggage Security Screening“. Transportation Research Record: Journal of the Transportation Research Board 1822, Nr. 1 (Januar 2003): 40–48. http://dx.doi.org/10.3141/1822-06.

Der volle Inhalt der Quelle

Annotation:

One of the most challenging tasks of the Aviation and Transportation Security Act of 2001 is to meet the goal of performing explosive detection system (EDS) screening on 100% of checked baggage by the end of calendar year 2002. Accomplishing this goal within the imposed deadline and within the typically tight space constraints of airport terminals will require significant changes in the way airlines and airports manage passengers and their baggage. One of the up-front keys to integrating 100% checked-baggage screening into airports is to identify realistic throughput rates of various EDS machines available to Transportation Security Administration (TSA) planners. Some of the issues associated with the implementation of EDS equipment are discussed, and an analysis is performed on the throughput of the equipment, using modeling and discrete event-simulation tools. One conclusion of the analysis is that a significant difference exists between the scan rate and the effective throughput rate for the InVision CTX5500, one of the tested EDS machines. This finding is extremely important for TSA planners, who are determining the number of EDS machines to buy and deploy at all 429 U.S. commercial airports. The deployments are based on passenger demand at peak hours of the day. Matching this relatively high-volume operation against the slow processing rate of a standalone EDS will generate large passenger queues unless multiple machines are installed to provide an acceptable level of customer (passenger) service. As a result, the effective throughput rate, not the machine scan rate, should be used in determining the number of EDS machines to install at a particular airport.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dissertationen zum Thema "Calendar queue"

1

Ramsey, Terry 1946. „The calendar heap: A new implementation of the calendar queue“. Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/291354.

Der volle Inhalt der Quelle

Annotation:

A new implementation of the calendar queue is described in this thesis. The calendar queue as previously implemented depended upon the use of multiple linked lists for the control of queue discipline. In the calendar heap implementation, the heap has been used to replace the previous functions of the linked list. Testing of the claim of O(1) execution time for the calendar queue was done. Comparisons of execution times of the calendar queue and the calendar heap have been made. Descriptions of the implementation as well as the complete C code for the calendar heap are included.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Kozovský, Daniel. „Implementace kalendáře událostí“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445524.

Der volle Inhalt der Quelle

Annotation:

This work aims to create a library in C++, which implements various variants of the pending event set, which is used in discrete simulations. The library includes nine different implementations of the pending event set, accessible through a single interface. This interface is designed to make it easy to extend the library with additional implementations. In addition to the library itself, the work also describes the design of the test application and evaluates the time complexity of individual implementations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Calendar queue"

1

Rab, Maryan, Romolo Marotta, Mauro Ianni, Alessandro Pellegrini und Francesco Quaglia. „NUMA-Aware Non-Blocking Calendar Queue“. In 2020 IEEE/ACM 24th International Symposium on Distributed Simulation and Real Time Applications (DS-RT). IEEE, 2020. http://dx.doi.org/10.1109/ds-rt50469.2020.9213639.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Marotta, Romolo, Mauro Ianni, Alessandro Pellegrini und Francesco Quaglia. „A Conflict-Resilient Lock-Free Calendar Queue for Scalable Share-Everything PDES Platforms“. In SIGSIM-PADS '17: SIGSIM Principles of Advanced Discrete Simulation. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3064911.3064926.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!