Distributed, low contention task allocation
Publisher: IEEE
Issue Date: 1-Oct-1996
Conference: 8th IEEE Symposium on Parallel and Distributed Processing 
Book: Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing 
Keywords: Load management, Throughput, Computer science, Real time systems, Distributed computing, Computer networks, Concurrent computing, Resource management, Algorithm design and analysis, Parallel processing
Abstract: 
A new approach to solve task allocation problems is proposed. The method involves introducing a load balancing network, a new class of distributed, and asynchronous algorithms for task allocation in shared memory multiprocessors. Load balancing networks generalize balancing networks to accommodate tasks with varying completion times. The load balancing networks substantially outperforms in performance classical, centralized methods for task allocation.
ISBN: 0-8186-7683-3
ISSN: 10636374
DOI: 10.1109/SPDP.1996.570355
URI: https://uniwacris.uniwa.gr/handle/3000/847
Type: Conference Paper
Department: Department of Archival, Library and Information Studies 
School: School of Administrative, Economics and Social Sciences 
Affiliation: University of West Attica (UNIWA) 
Appears in Collections:Book Chapter / Κεφάλαιο Βιβλίου

CORE Recommender
Show full item record

SCOPUSTM   
Citations 10

7
checked on Nov 19, 2024

Page view(s)

38
checked on Nov 23, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.