Execution of compute-intensive applications into parallel machines
Authors: Houstis, Catherine 
Kapidakis, Sarantos 
Markatos, Evangelos 
Gelenbe, Erol 
Publisher: Elsevier
Issue Date: 1-Mar-1997
Journal: Information Sciences 
Volume: 97
Issue: 1-2
Abstract: 
Scheduling and load balancing of applications on distributed or shared-memory machine architectures can be executed by optimizing algorithms in various levels of the architecture. We are viewing four different levels, namely, the application layer, the compiler layer, the run-time layer, and the operating system layer. The approach to scheduling and load balancing ranges from very specialized and directly dependent on the application, in the application layer, to a more general approach taken by the operating system layer. In the application layer, the application's computation is decomposed and evenly assigned to the processors, while communication and synchronization are minimized. In addition, specific knowledge about the application is taken into account to select the approach to problem solution. In the compiler layer, the application code is automatically decomposed by the compiler, most of the work being concentrated in the parallelization of language constructs. In the run-time layer, the results of the application and the compiler layers are implemented. Finally, in the operating system layer, a fair allocation of the processors of the parallel machine is allocated to competing applications.
ISSN: 00200255
DOI: 10.1016/S0020-0255(96)00174-0
URI: https://uniwacris.uniwa.gr/handle/3000/741
Type: Article
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:Articles / Άρθρα

CORE Recommender
Show full item record

SCOPUSTM   
Citations 20

4
checked on Dec 20, 2024

Page view(s)

34
checked on Dec 22, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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