Thematische Bibliographien / Asynchronous scheduler

Auswahl der wissenschaftlichen Literatur zum Thema „Asynchronous scheduler“

Autor: Grafiati
Veröffentlicht am 25. Mai 2024

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

Wählen Sie eine Art der Quelle aus:

Inhaltsverzeichnis

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Asynchronous scheduler" 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 "Asynchronous scheduler"

1

Cicerone, Serafino, Gabriele Di Stefano und Alfredo Navarra. „“Semi-Asynchronous”: A New Scheduler in Distributed Computing“. IEEE Access 9 (2021): 41540–57. http://dx.doi.org/10.1109/access.2021.3064880.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Pinkas, G., und R. Dechter. „Improving Connectionist Energy Minimization“. Journal of Artificial Intelligence Research 3 (01.10.1995): 223–48. http://dx.doi.org/10.1613/jair.130.

Der volle Inhalt der Quelle
Annotation:
Symmetric networks designed for energy minimization such as Boltzman machines and Hopfield nets are frequently investigated for use in optimization, constraint satisfaction and approximation of NP-hard problems. Nevertheless, finding a global solution (i.e., a global minimum for the energy function) is not guaranteed and even a local solution may take an exponential number of steps. We propose an improvement to the standard local activation function used for such networks. The improved algorithm guarantees that a global minimum is found in linear time for tree-like subnetworks. The algorithm, called activate, is uniform and does not assume that the network is tree-like. It can identify tree-like subnetworks even in cyclic topologies (arbitrary networks) and avoid local minima along these trees. For acyclic networks, the algorithm is guaranteed to converge to a global minimum from any initial state of the system (self-stabilization) and remains correct under various types of schedulers. On the negative side, we show that in the presence of cycles, no uniform algorithm exists that guarantees optimality even under a sequential asynchronous scheduler. An asynchronous scheduler can activate only one unit at a time while a synchronous scheduler can activate any number of units in a single time step. In addition, no uniform algorithm exists to optimize even acyclic networks when the scheduler is synchronous. Finally, we show how the algorithm can be improved using the cycle-cutset scheme. The general algorithm, called activate-with-cutset, improves over activate and has some performance guarantees that are related to the size of the network's cycle-cutset.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

SRIVASTAVA, JAIDEEP, JAU-HWANG WANG, KUO WEI HWANG und WEI TEK TSAI. „A TRANSACTION MODEL FOR PARALLEL RULE EXECUTION PART I: MODEL AND ALGORITHMS“. International Journal on Artificial Intelligence Tools 02, Nr. 03 (September 1993): 395–429. http://dx.doi.org/10.1142/s0218213093000205.

Der volle Inhalt der Quelle
Annotation:
This paper introduces a transaction model for parallel production systems, where rules can be fired in a completely asynchronous parallel manner. A model is developed to describe two properties of a serial production system execution, namely, conditional dependence (a rule firing removes another from the conflict set) and prioritization (by the conflict resolution mechanism). These are used as the basis to define the correctness criteria for parallel production execution, namely, conditional serializability, prioritized serializability, and prioritized conditional serializability. A graph model is used to represent production system execution which provides a means of expressing correctness as graph acyclicity, which in turn is used as a basis to develop practical schedulers that manage the concurrent asynchronous production execution and ensure correctness. Two practical schedulers, namely, conditional strict two-phase locking and priority queue scheduler are developed for conditional serializability and prioritized serializability, respectively. They are combined for prioritized conditional serializability.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Pavon-Marino, P., M. Bueno-Delgado, W. Cerroni, A. Campi und F. Callegati. „A parallel iterative scheduler for asynchronous Optical Packet Switching networks“. Optical Switching and Networking 8, Nr. 2 (April 2011): 103–15. http://dx.doi.org/10.1016/j.osn.2010.11.001.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Sun, Jianhui, Xidong Wu, Heng Huang und Aidong Zhang. „On the Role of Server Momentum in Federated Learning“. Proceedings of the AAAI Conference on Artificial Intelligence 38, Nr. 13 (24.03.2024): 15164–72. http://dx.doi.org/10.1609/aaai.v38i13.29439.

Der volle Inhalt der Quelle
Annotation:
Federated Averaging (FedAvg) is known to experience convergence issues when encountering significant clients system heterogeneity and data heterogeneity. Server momentum has been proposed as an effective mitigation. However, existing server momentum works are restrictive in the momentum formulation, do not properly schedule hyperparameters and focus only on system homogeneous settings, which leaves the role of server momentum still an under-explored problem. In this paper, we propose a general framework for server momentum, that (a) covers a large class of momentum schemes that are unexplored in federated learning (FL), (b) enables a popular stagewise hyperparameter scheduler, (c) allows heterogeneous and asynchronous local computing. We provide rigorous convergence analysis for the proposed framework. To our best knowledge, this is the first work that thoroughly analyzes the performances of server momentum with a hyperparameter scheduler and system heterogeneity. Extensive experiments validate the effectiveness of our proposed framework. Due to page limit, we leave all proofs to the full version https://arxiv.org/abs/2312.12670.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Aumann, Yonatan, und Michael A. Bender. „Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler“. Distributed Computing 17, Nr. 3 (März 2005): 191–207. http://dx.doi.org/10.1007/s00446-004-0113-4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Shakir, Shaffath Hussain, und A. Rajesh. „Improved calendar disc scheduler for LTE advanced networks with HARQ“. Journal of High Speed Networks 27, Nr. 2 (07.07.2021): 139–49. http://dx.doi.org/10.3233/jhs-210656.

Der volle Inhalt der Quelle
Annotation:
Long Term Evolution Advanced (LTE-A) is a broadband wireless technology that supports variety of services with different data rate. In order to achieve this the evolved Node B (eNB) uses different features provided in the 3GPP standards. Features like Carrier Aggregation (CA), Multiple input and Multiple output (MIMO) and Hybrid Automatic Repeat Request (HARQ) help to increase the throughput and spectral efficiency. In this paper, a novel two-level calendar disc algorithm with HARQ is introduced at the eNB for effectively scheduling real time and non-real time traffic with different service types. The algorithm also uses a burst profile management module that analyzes the current user profile and notifies the scheduler about the need to change in profile based on power boosting. The Calendar Disc Scheduler (CDS) is improved by adding HARQ retransmission index as a parameter in calculating the metric weight. The scheduler was tested for both adaptive and non-adaptive methods of HARQ in both synchronous and asynchronous modes. The proposed improved CDS scheduler was simulated with LTESim simulator and compared with calendar disc algorithm without HARQ improvements. Results show that the proposed scheduling method provides increased performance in terms of goodput, delay and spectral efficiency.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Peng, Quan, und Shan Wang. „MASA: Multi-Application Scheduling Algorithm for Heterogeneous Resource Platform“. Electronics 12, Nr. 19 (27.09.2023): 4056. http://dx.doi.org/10.3390/electronics12194056.

Der volle Inhalt der Quelle
Annotation:
Heterogeneous architecture-based systems-on-chip enable the development of flexible and powerful multifunctional RF systems. In complex and dynamic environments where applications arrive continuously and stochastically, real-time scheduling of multiple applications to appropriate processor resources is crucial for fully utilizing the heterogeneous SoC’s resource potential. However, heterogeneous resource-scheduling algorithms still face many problems in practical situations, including generalized abstraction of applications and heterogeneous resources, resource allocation, efficient scheduling of multiple applications in complex mission scenarios, and how to ensure the effectiveness combining with real-world applications of scheduling algorithms. Therefore, in this paper, we design the Multi-Application Scheduling Algorithm, named MASA, which is a two-phase scheduler architecture based on Deep Reinforcement Learning. The algorithm is made up of neural network scheduler-based task prioritization for dynamic encoding of applications and heuristic scheduler-based task mapping for solving the processor resource allocation problem. In order to achieve stable and fast training of the network scheduler based on the actor–critic strategy, we propose optimization methods for the training of MASA: reward dynamic alignment (RDA), earlier termination of the initial episodes, and asynchronous multi-agent training. The performance of the MASA is tested with classic directed acyclic graph and six real-world application datasets, respectively. Experimental results show that MASA outperforms other neural scheduling algorithms and heuristics, and ablation experiments illustrate how these training optimizations improve the network’s capacity.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Ageev, Aleksey Vladimirovich, Andrey Alexandrovich Boguslavskiy und Sergey Mikhailovich Sokolov. „Task scheduling in the onboard computer system“. Keldysh Institute Preprints, Nr. 43 (2023): 1–27. http://dx.doi.org/10.20948/prepr-2023-43.

Der volle Inhalt der Quelle
Annotation:
The problem of rational resource allocation in the on-board computing system of a robotic complex is considered. As a first step, the possibility of using online scheduling algorithms without preemptive for distributed systems, the Round Robin cyclic algorithm, is analyzed. To demonstrate the basic capabilities of the developed scheduler, a video stream segmentation task is used. The peculiarities of task processing for real-time vision systems are demonstrated. The problem of inter-node synchronization of sensor data is solved. A feature of on-board robotics resources, such as the need for a linking software in the form of Robot Operation System, is taken into account. To develop the task scheduler, the C++ programming language and the ROS2 framework, which provides asynchronous networking, are used. A scheduling model and software implementing this model are being built to perform tasks in a distributed environment in order to control the processing of video streams in a vision system.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Lv, Fang, Lei Liu, Hui-min Cui, Lei Wang, Ying Liu, Xiao-bing Feng und Pen-Chung Yew. „WiseThrottling: a new asynchronous task scheduler for mitigating I/O bottleneck in large-scale datacenter servers“. Journal of Supercomputing 71, Nr. 8 (26.04.2015): 3054–93. http://dx.doi.org/10.1007/s11227-015-1427-7.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Asynchronous scheduler"

1

Fang, Jun. „Design of an ATM switch and implementation of output scheduler /“. Title page, contents and abstract only, 1999. http://web4.library.adelaide.edu.au/theses/09ENS/09ensf211.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Baheri, Betis. „MARS: Multi-Scalable Actor-Critic Reinforcement Learning Scheduler“. Kent State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=kent1595039454920637.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Heriban, Adam. „Réseaux de robots réalistes“. Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS325.

Der volle Inhalt der Quelle
Annotation:
Le but de cette thèse est d'analyser le travail existant par la communauté de robotique distribuée pour trouver des variations réalistes du modèle standard OBLOT, et développer de nouvelles variations viables à long terme. Nous développons un nouvel algorithme optimal pour le rendez-vous avec des lumières, et le prouvons en utilisant le framework de model-checking SPIN. En utilisant ce modèle, nous construisons des algorithmes d'élection de leader robustes, permettant des contraintes plus strictes. Nous définissons un nouveau modèle de vision pour les robots mobile : Uncertain Visibility, qui utilise un adversaire pour représenter des faux-négatifs des capteurs, et prouvons les bornes de plusieurs problèmes étalons dans ce modèle. Nous définissons et analysons un nouveau problème : Obstruction Detection pour le modèle des robots opaques. Nous développons un simulateur Monte-Carlo pour les robots mobiles, conçus pour facilement simuler n'importe quel modèle ou algorithme. N'étant pas un model-checker, il vise d'abord a remplacer "l'intuition" des chercheurs pour détecter des comportement imprévus. Nous testons plusieurs algorithmes et modèles, avec des résultats encourageants. Enfin, nous présentons deux nouveaux algorithmes : le premier assure que la distance parcourue pour la convergence en ASYNC est minimale ; le second permet d'élire un Leader avec des capteurs imprécis
The goal of this thesis is to survey and analyze the current work done by the distributed robotics community to find the more realistic variations of the standard OBLOT model, develop new such variations, and determine which approach should be used in the long term. We develop a new, optimal Rendezvous algorithm using lights, and prove it using a model checking framework based on the SPIN model checker. The same luminous model is used to build robust Leader Election algorithms, which allow for stricter constraints. We design a new vision model for mobile robots, Uncertain Visibility, which introduces a vision adversary to model false negatives in sensors, and prove tight bounds under this new model for several benchmark problems. We then define and investigate a new problem, Obstruction Detection, for the obstructed visibility model. To facilitate analysis of robot networks, we develop a framework for Monte-Carlo simulations of mobile robots, designed to simulate any model or algorithm with minimal effort. It is designed as a complement to researcher "intuition" to look for unexpected behavior. We test this simulator against numerous algorithms and settings, yielding encouraging results. Finally, we introduce another two algorithms: the first ensures the distance traveled for convergence in ASYNC is minimal ; the second allows for Leader Election with errors in vision
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Asynchronous scheduler"

1

Aumann, Yonatan, und Michael A. Bender. „Efficient asynchronous consensus with the value-oblivious adversary scheduler“. In Automata, Languages and Programming, 622–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61440-0_164.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Anchora, Luca, Antonio Capone und Luigi Patrono. „An Asynchronous Scheduler to Minimize Energy Consumption in Wireless Sensor Networks“. In Smart Spaces and Next Generation Wired/Wireless Networking, 262–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22875-9_24.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Friese, Peter. „Combine Schedulers and SwiftUI“. In Asynchronous Programming with SwiftUI and Combine, 337–59. Berkeley, CA: Apress, 2023. http://dx.doi.org/10.1007/978-1-4842-8572-5_13.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Chistikov, Dmitry, Rupak Majumdar und Filip Niksic. „Hitting Families of Schedules for Asynchronous Programs“. In Computer Aided Verification, 157–76. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41540-6_9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

de Groot, Coen. „Writing a scheduler from scratch“. In Asynchronous Python Programming with Asyncio and Async/await. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8140-6_19.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Khrystynets, Nataliia, Kateryna Melnyk, Svitlana Lavrenchuk, Oksana Miskevych und Serhii Kostiuchko. „Multiprocessing as a Way to Optimize Queries“. In Advances in Transdisciplinary Engineering. IOS Press, 2024. http://dx.doi.org/10.3233/atde231357.

Der volle Inhalt der Quelle
Annotation:
Developing an effective web application involves the use of various methods and techniques to ensure fast and efficient processing of requests. Sometimes it is not possible to solve the problem of multiprocessing with a single tool, such as a programming language or framework. This work investigates the use of asynchronous methods of processing requests using queues. Job operation in background and non-background modes relative to the main web process is studied. Analytics are provided to analyze a web application with 13,000 requests to process daily. It is proposed to optimize the processing by using the Laravel framework and the Python server dual-tasking using the Supervisor tool on Linux, as well as using a task scheduler for each task. The paper presents positive findings about this algorithm, which contributes to the efficiency of web development and provides a great user experience on the website. Fast processing of web application requests can be a valuable competitive advantage for a business or organization. Research in this field helps to maintain their high competitiveness. In addition, the study of query processing speed is important in scientific research, as it contributes to the development of new algorithms, optimization methods and technologies.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Bezboruah, Karabi C. „Live Sessions and Accelerated Online Project-Based Courses“. In Educational Technology and Resources for Synchronous Learning in Higher Education, 23–55. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7567-2.ch002.

Der volle Inhalt der Quelle
Annotation:
This chapter assesses the incorporation of synchronous and asynchronous instructional techniques in two project-based graduate level courses in an online public administration program. These courses are eight weeks long and taken sequentially, and have a variety of assignments requiring synchronous and asynchronous interactions with instructor and peers. It evaluates the application of synchronous instructional techniques and asks if synchronous sessions result in higher student engagement and collaborative activity. Further, the study examines if synchronous sessions matter to online graduate level students. Results indicate that synchronous sessions complement asynchronous assignments by enhancing interaction with instructor and peers, and assisting with course concepts. Students benefited from these sessions and were greatly in favor of having them. However, these sessions are challenging to schedule requiring intensive pre-implementation planning and instructor engagement. It was found that both synchronous and asynchronous techniques add value to online learning.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Bezboruah, Karabi C. „Live Sessions and Accelerated Online Project-Based Courses“. In Research Anthology on Remote Teaching and Learning and the Future of Online Education, 857–82. IGI Global, 2022. http://dx.doi.org/10.4018/978-1-6684-7540-9.ch043.

Der volle Inhalt der Quelle
Annotation:
This chapter assesses the incorporation of synchronous and asynchronous instructional techniques in two project-based graduate level courses in an online public administration program. These courses are eight weeks long and taken sequentially, and have a variety of assignments requiring synchronous and asynchronous interactions with instructor and peers. It evaluates the application of synchronous instructional techniques and asks if synchronous sessions result in higher student engagement and collaborative activity. Further, the study examines if synchronous sessions matter to online graduate level students. Results indicate that synchronous sessions complement asynchronous assignments by enhancing interaction with instructor and peers, and assisting with course concepts. Students benefited from these sessions and were greatly in favor of having them. However, these sessions are challenging to schedule requiring intensive pre-implementation planning and instructor engagement. It was found that both synchronous and asynchronous techniques add value to online learning.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Chatterjea, Kalyani. „A Blended Approach Learning Strategy for Teacher Development“. In Advances in End User Computing, 301–21. IGI Global, 2005. http://dx.doi.org/10.4018/978-1-59140-474-3.ch015.

Der volle Inhalt der Quelle
Annotation:
In-service upgrading has been an accepted avenue for retraining practicing teachers in Singapore to keep abreast of changing curriculum requirements as well as infusion of information technology (IT) in teaching and learning. To cope with the teachers’ busy work schedules and many school commitments, upgrading courses were offered to the teachers primarily asynchronously, using the Internet platform with some integrated synchronous sessions. This chapter analyzes the rationale for the development of such a Web-based teacher-upgrading program and discusses the main issues of professional upgrading addressed in the development. Issues of adult learning in a learner-controlled adaptive learning environment and lifelong learning were addressed through an IT-infused asynchronous mode, providing the much-needed freedom in time management for the course participants. The development also includes delivery of high definition graphics through a customized hybrid system of CD-ROM and Web that addresses image-downloading bottleneck and thereby overcomes a basic problem of distance learning in geospatial education. Finally, reflections on the attending adult learners’ responses to such an upgrading program are discussed.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Chatterjea, Kalyani. „Asynchronous Learning Using a Hybrid Learning Package“. In End-User Computing, 594–610. IGI Global, 2008. http://dx.doi.org/10.4018/978-1-59904-945-8.ch046.

Der volle Inhalt der Quelle
Annotation:
This article analyses the rationale for the development of a Web-based teacher-upgrading programme and discusses the main issues of in-service professional upgrading of working adults using the WWW. In-service upgrading has been an accepted avenue for retraining practising teachers in Singapore to keep abreast of changing curriculum requirements as well as infusion of information technology in teaching and learning. To cope with the teachers’ busy work schedule and many school commitments upgrading courses were offered to the teachers primarily asynchronously, using the Internet platform with some integrated synchronous sessions. Issues of adult learning in a learner-controlled adaptive learning environment, and life-long learning were addressed through an IT-infused asynchronous mode, providing the much-needed freedom in time management for the course participants. The development also includes delivery of high definition graphics through a customized hybrid system of CD-ROM and Web that addresses image-downloading bottleneck and thereby overcomes a basic problem of distance learning in geo-spatial education. Finally reflections on the attending adult learners’ responses to such an upgrading programme are discussed.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Asynchronous scheduler"

1

Xiangming Dai und Brahim Bensaou. „A novel decentralized asynchronous scheduler for Hadoop“. In 2013 IEEE Global Communications Conference (GLOBECOM 2013). IEEE, 2013. http://dx.doi.org/10.1109/glocom.2013.6831281.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Aumann, Yonatan. „Efficient asynchronous consensus with the weak adversary scheduler“. In the sixteenth annual ACM symposium. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/259380.259441.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Zhang, Shiyan, Xiangyang Gong, Puye Wang, Long Wang, Tongtong Wang, Xirong Que und Ye Tian. „Deterministic Transmittable Time-based Asynchronous Scheduler for Fronthaul Networks“. In 2019 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2019. http://dx.doi.org/10.1109/wcnc.2019.8885773.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Bardakoff, Alexandre, Bruno Bachelet, Timothy Blattner, Walid Keyrouz, Gerson C. Kroiz und Loic Yon. „Hedgehog: Understandable Scheduler-Free Heterogeneous Asynchronous Multithreaded Data-Flow Graphs“. In 2020 IEEE/ACM 3rd Annual Parallel Applications Workshop: Alternatives To MPI+X (PAW-ATM). IEEE, 2020. http://dx.doi.org/10.1109/pawatm51920.2020.00006.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Cicerone, Serafino, Gabriele Di Stefano und Alfredo Navarra. „"Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems“. In 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS). IEEE, 2018. http://dx.doi.org/10.1109/icdcs.2018.00027.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Modiano, E., und R. Barry. „Design and analysis of an asynchronous WDM local area network using a master/slave scheduler“. In IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320). IEEE, 1999. http://dx.doi.org/10.1109/infcom.1999.751479.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Blake, John W. „Using Videotape to Add an Asynchronous Delivery Option to Regular Classroom Instruction“. In ASME 2003 International Mechanical Engineering Congress and Exposition. ASMEDC, 2003. http://dx.doi.org/10.1115/imece2003-42364.

Der volle Inhalt der Quelle
Annotation:
Student schedules are often at odds, forcing them to miss needed classes due to time conflicts. Departments have limited faculty resources, and cannot offer courses every term at times to meet every need. This paper describes the use of instruction via videotape to offer students an option for taking courses when they cannot attend at the scheduled time. Delivery of instruction by videotape is not new; this paper describes efforts to adapt this method to specific circumstances and student needs. This has resulted in higher course enrollments when videotape and traditional sections are combined for teaching load purposes, and has permitted students to complete graduation requirements when, without this option, they would have been delayed due to scheduling conflicts.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Turner, J. „Strong Performance Guarantees for Asynchronous Crossbar Schedulers“. In Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications. IEEE, 2006. http://dx.doi.org/10.1109/infocom.2006.135.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Tibbals, Thomas F., Theodore A. Bapty und Ben A. Abbott. „CADDMAS: A Real-Time Parallel System for Dynamic Data Analysis“. In ASME 1994 International Gas Turbine and Aeroengine Congress and Exposition. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/94-gt-194.

Der volle Inhalt der Quelle
Annotation:
Arnold Engineering Development Center (AEDC) has designed and built a high-speed data acquisition and processing system for real-time online dynamic data monitoring and analysis. The Computer Assisted Dynamic Data Monitoring and Analysis System (CADDMAS) provides 24 channels at high frequency and another 24 channels at low frequency for online real-time aeromechanical, vibration, and performance analysis of advanced turbo-engines and other systems. The system is primarily built around two different parallel processors and several PCs to demonstrate hardware independence and architecture scalability. These processors provide the computational power to display online and in real-time what can take from days to weeks using existing offline techniques. The CADDMAS provides online test direction and immediate hardcopy plots for critical parameters, all the while providing continuous health monitoring through parameter limit checking. Special in-house developed Front End Processors (FEP) sample the dynamic signals, perform anti-aliasing, signal transfer function correction, and bandlimit filtering to improve the accuracy of the time domain signal. A second in-house developed Numeric Processing Element (NPE) performs the FFT, threshold monitoring, and packetizes the data for rapid asynchronous access by the parallel network. Finally, the data are then formatted for display, hardcopy plotting, and cross-channel processing within the parallel network utilizing off-the-shelf hardware. The parallel network is a heterogeneous message-passing parallel pipeline configuration which permits easy scaling of the system. Advanced parallel processing scheduler/controller software has been adapted specifically for CADDMAS to allow quasi-dynamic instantiation of a variety of simultaneous data processing tasks concurrent with display and alarm monitoring functions without gapping the data. Although many applications of CADDMAS exist, this paper describes the features of CADDMAS, the development approach, and the application of CADDMAS for turbine engine aeromechanical testing.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Kotleas, I., D. Humphreys, R. B. Sorensen, E. Kasapaki, F. Brandner und J. Sparso. „A loosely synchronizing asynchronous router for TDM-scheduled NOCs“. In 2014 Eighth IEEE/ACM International Symposium on Networks-on-Chip (NoCS). IEEE, 2014. http://dx.doi.org/10.1109/nocs.2014.7008774.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Asynchronous scheduler" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel
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!

Zur Bibliographie