We propose a hybrid parallelism-independent scheduling method, predominantly performed at compile time, which generates a machine code efficiently executable on any number of workstations or PCs in a cluster computing...
详细信息
ISBN:
(纸本)0769516262
We propose a hybrid parallelism-independent scheduling method, predominantly performed at compile time, which generates a machine code efficiently executable on any number of workstations or PCs in a cluster computing environment. Our new scheduling algorithm called Dynamical Level Parallelism-Independent Scheduling algorithm (DLPIS) is applicable for distributed computer systems because additionally to the task scheduling, we perform a message communication scheduling. It provides an explicit task synchronization mechanism guiding the task allocation and data dependency solution at run time at reduced overhead. Furthermore, we provide a mechanism allowing the self-adaptation of the machine code to the degree of parallelism of the system at run-time. therefore our scheduling method supports the variable number of processors in the users' computing systems and the adaptive parallelism, which may occur in distributed computing systems due to computer or link failure.
Grid or mesh techniques are frequently used to approximate continuous entities that behave in a wave or fluid-like fashion. Partial Differential Equations (PDE's) are usually involved in the description of such en...
详细信息
ISBN:
(纸本)0769516262
Grid or mesh techniques are frequently used to approximate continuous entities that behave in a wave or fluid-like fashion. Partial Differential Equations (PDE's) are usually involved in the description of such entities or processes. Distributed parallel computation was used in various computer cluster configurations to calculate PDE solutions of electrostatic field. the study of the efficacy of the selected architecture using mesh techniques was intended. the match between the algorithm and the architecture in achieving maximum computational performance was also investigated. the developed architectures, algorithms, and findings are presented in the paper.
In this work we discuss a range of approaches to full-system simulation of distributed memory parallel computers, with emphasis on the interconnection network. We present our environment, based on Simics, and discuss ...
详细信息
ISBN:
(纸本)1595936734
In this work we discuss a range of approaches to full-system simulation of distributed memory parallel computers, with emphasis on the interconnection network. We present our environment, based on Simics, and discuss how unforeseen interactions and fine tuning of components can affect results.
the adequate occupation of the computing resources can influence, in a decisive way, the global performance of the system. therefore, in order to achieve a highperformance, it is mandatory to know all the computing r...
详细信息
ISBN:
(纸本)0769516262
the adequate occupation of the computing resources can influence, in a decisive way, the global performance of the system. therefore, in order to achieve a highperformance, it is mandatory to know all the computing resources involved and their respective occupation level in a certain moment. Withthe objective of improving the system performance, this paper presents the OpenTella model to update the information related to the occupation of resources and the respective analysis of this occupation so that the migration of processes among computers of a same cluster can be completed. Withthe objective of increasing the scale level in the system and decreasing the number of messages among the computers, this Peer-to-peer protocol defines sub-nets, which are clusters that make up a more comprehensive cluster. thus, groups are defined to interchange information and update the occupation of resources, in order to minimize the communication and to achieve a calculation to balance the load and meet the system needs, resulting in the migration of processes.
the subject of this paper is to show the very high power of asynchronism for iterative algorithms in the context of global computing, that is to say, with machines scattered all around the world. the question is wheth...
详细信息
ISBN:
(纸本)0769516262
the subject of this paper is to show the very high power of asynchronism for iterative algorithms in the context of global computing, that is to say, with machines scattered all around the world. the question is whether or not asynchronism helps to reduce the communication penalty and the overall computation time of a given parallel algorithm. the asynchronous programming model is applied to a given problem implemented with a multi-threaded environment and tested over two kinds of clusters of workstations;a homogeneous local cluster and a heterogeneous non-local one. the main features of this programming model are exhibited and the high efficiency and interest of such algorithms is pointed out.
We present the Lightweight Information Validation Environment, LIVE as asolution to the high complexity and data sizes of modern day computational science applications. LIVE is a data workspace that facilitates the cr...
详细信息
ISBN:
(纸本)1595936734
We present the Lightweight Information Validation Environment, LIVE as asolution to the high complexity and data sizes of modern day computational science applications. LIVE is a data workspace that facilitates the creation of dynamic data processing overlays we call I/O graphs. We use LIVE as aplatform for dynamic extension of scientific applications using lightweight data extraction, runtime discovery and flexible data selection.
Traditional network design incorporates a failure-recovery model in order to allow calculation of problems independent of knowledge of the network tool layer this paper explores the possibilities of improving the calc...
详细信息
ISBN:
(纸本)0769516262
Traditional network design incorporates a failure-recovery model in order to allow calculation of problems independent of knowledge of the network tool layer this paper explores the possibilities of improving the calculation throughput by constructing a tool for the specific solution of problems which have an inherent ability to deal with partial calculation failure. Using a modified Genetic Algorithm as the client tool, the amount of information the network layer needs to have is brought to an extremely minimal level;this allows for a large scalability factor of the tool due to the reduction of network management tables.
暂无评论