Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
Non-Asymptotic Delay Bounds for Multi-Server Systems with Synchronization Constraints. |
| Συγγραφείς: |
Fidler, Markus1 markus.fidler@ikt.uni-hannover.de, Walker, Brenton1 brenton.walker@ikt.uni-hannover.de, Jiang, Yuming2 jiang@ntnu.no |
| Πηγή: |
IEEE Transactions on Parallel & Distributed Systems. Jul2018, Vol. 29 Issue 7, p1545-1559. 15p. |
| Θεματικοί όροι: |
*Parallel processing, Parallel computers, Parallel programs (Computer programs), Synchronization, Machine learning |
| Περίληψη: |
Parallel computing has become a standard tool with architectures such as Google MapReduce, Hadoop, and Spark being broadly used in applications such as data processing and machine learning. Common to these systems are a fork operation, where jobs are first divided into tasks that are processed in parallel, and a join operation where completed tasks wait for the other tasks of the job before leaving the system. The synchronization constraint of the join operation makes the analysis of fork-join systems challenging, and few explicit results are known. In this work, we formulate a max-plus server model for parallel systems which allows us to derive performance bounds for a variety of systems in the GI [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Parallel & Distributed Systems is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |