Treffer: Scheduling Algorithms in Parallel Processing: A Survey.

Parallel processing is vital in modern computing, as it distributes complex tasks across multiple processors or cores, significantly improving performance and efficiency. The effectiveness of such systems is significantly influenced by scheduling algorithms that optimize execution time, load balancing, and resource utilization. An overview of scheduling for parallel processing is provided by this survey, with a focus on static, dynamic, heuristic, and hybrid algorithms. Special attention is given to Directed Acyclic Graph (DAG)-based algorithms, which addresses task dependencies and precedence constraints in real world systems. As scheduling problems are typically NP-Complete, various algorithms have been designed to address these challenges. This review paper provides a comprehensive analysis of various DAG-based scheduling algorithms, including list-based, task duplication, and clustering methods. These algorithms are evaluated in terms of their ability to minimize task execution time, improve resource utilization, and handle task dependencies. Additionally, this review examines the limitations of existing algorithms and highlights areas where additional research is necessary to tackle the increasing complexity of contemporary parallel computing systems. [ABSTRACT FROM AUTHOR]

المقال يقدم مسحًا شاملاً لخوارزميات الجدولة في المعالجة المتوازية، مع التركيز على الطرق المعتمدة على الرسوم البيانية الموجهة غير الدائرية (DAG). يصنف هذه الخوارزميات إلى ثلاثة أنواع رئيسية: الجدولة المعتمدة على القوائم، والجدولة المعتمدة على تكرار المهام، والجدولة المعتمدة على التجمعات، حيث تتناول كل منها تحديات جدولة المهام بطرق مختلفة. يقوم المسح بتقييم نقاط القوة والضعف في الخوارزميات المختلفة، مع تسليط الضوء على تطبيقاتها في تحسين وقت التنفيذ، واستخدام الموارد، وإدارة تبعيات المهام. بالإضافة إلى ذلك، يناقش تعقيد مشاكل الجدولة ويقترح مجالات للبحث المستقبلي لتعزيز كفاءة أنظمة الحوسبة المتوازية المعاصرة. [Extracted from the article]

Copyright of Egyptian International Journal of Engineering Sciences & Technology (EIJEST) is the property of Egyptian International Journal of Engineering Sciences & Technology 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.)