The Multi-Level computing Architecture (MLCA) is a novel parallel Programmable systems-on-a-chip (PP-SoC) for multimedia applications, which promises to address the pro-grammability challenge for PP-SoCs. The MLCA pro...
详细信息
ISBN:
(纸本)9780889867048
The Multi-Level computing Architecture (MLCA) is a novel parallel Programmable systems-on-a-chip (PP-SoC) for multimedia applications, which promises to address the pro-grammability challenge for PP-SoCs. The MLCA programming model requires that coarse-grain units of computation, or tasks, be identified and extracted out of sequential code. This paper describes an approach to automatically generating tasks from sequential programs to target the MLCA. The approach uses a new compiler pragma called Split to describe task boundaries in a sequential program. A compiler heuristic is developed to place this pragma in the program, effectively marking task boundaries. The compiler is then used to generate task code, ensuring correct control and data flow on the MLCA. Experimental evaluation of this approach, implemented in a prototype compiler and using realistic multimedia applications, shows that the approach is effective in extracting tasks out of sequential programs and that it results in MLCA programs whose performance is comparable to that of manually task - generated code.
The past decade has witnessed a boost in the acceptance of Grid computing as an alternative to traditional supercomputing environments. The evolution of Computers, Networks and the Internet has boosted the growth of G...
详细信息
ISBN:
(纸本)9780889867048
The past decade has witnessed a boost in the acceptance of Grid computing as an alternative to traditional supercomputing environments. The evolution of Computers, Networks and the Internet has boosted the growth of Grid computing. However applications with fine grained jobs tend to be unfavorable for this environment. Further applications that possess jobs that are dependent upon each other need to be grouped together and represented in a coarse-grained manner to lower the overheads involved with fine grained jobs, and rescheduling of dependent jobs. Also, there is a need to impose ordering on resource selection based on their processing capabilities and dynamic bandwidth scenarios. Users with different priorities must be provided differentiated Network ToS to ensure high Success Rates of job completion. In this paper, we investigate a dependency based, Network Aware, dynamic job grouping scheduler, which provides Network ToS to Users based on their deadlines.
This paper propose a new approach to improve the Dynamic distributed Double Guided Genetic Algorithm (D3G2A) dealing with Maximal Constraint Satisfaction Problems. Inspired by the NEO-DARWINISM theory and the nature l...
详细信息
ISBN:
(纸本)9780889867048
This paper propose a new approach to improve the Dynamic distributed Double Guided Genetic Algorithm (D3G2A) dealing with Maximal Constraint Satisfaction Problems. Inspired by the NEO-DARWINISM theory and the nature laws, D3G2A consists in creating agents cooperating together to solve problems. In D3G2A, It was proved that the spent CPU time could be improved. The new approach Inspired by the D 3G2A for CSOP and ΣCSPs, will redistribute the load of species agents more equally in order to better the CPU time. This improvement allows not only reduction in species agent's number but also decrease communications agents cost. Thus, a sub-population is composed of chromosomes violating a number of constraints in the same interval. In the present paper, the new approach is first described and then compared with the old one. Results of experimentations are analyzed and discussed.
Java applications are multithreaded by nature. It is popularly used for developing various applications running heavy workload. Today, these applications have grown too heavy and complex to be handled by a single comp...
详细信息
ISBN:
(纸本)9780889867048
Java applications are multithreaded by nature. It is popularly used for developing various applications running heavy workload. Today, these applications have grown too heavy and complex to be handled by a single computer. On the rise of the clustering concept in computing, many machines are connected and inter-supporting each other. However, the conventional JVM [1] is not able to support distribution of workload within the clustered terminals. This paper describes our findings on the techniques of migrating the Java threads. The migration techniques provide a platform for workload distribution within a cluster. Our implementation was done on top of Jikes RVM and supports transparent migration of the mutually independent Java threads from one node to another. We have tested our implementation by using the AES encryption application and the threads can be migrated successfully.
Nowadays, the partition problem in the parallelcomputing is becoming more and more important [1]. Particular in power system dynamic simulation, it is critical to design an efficient partition method to reduce the co...
详细信息
ISBN:
(纸本)9780889866379
Nowadays, the partition problem in the parallelcomputing is becoming more and more important [1]. Particular in power system dynamic simulation, it is critical to design an efficient partition method to reduce the communication and balance the computation of each process. This paper presents a novel multilevel partition scheme for parallelcomputing based on the bisection graph partition algorithm. By introducing the weight of the nodes and lines which can represent the amount of communication and computation of each unit effectively, the evaluation function and other means, we can efficiently improve the defects in the traditional partition method and the simple district method. Simulations of the new method were performed for two large scale power systems. With eight and twelve CPUs, the efficiency of our algorithm was about 70% and 63% higher than that of METIS, a famous program used for partitioning graphs and hypergraphs and computing fill-reducing orderings of sparse matrices. Thus, the algorithm satisfies the dynamic simulation requirement for large scale complex power grids.
parallel applications are notorious for their intractability to performance debugging. Automatic performance analysis techniques, such as those used by Kojak and KappaPI, are promising in alleviating the difficulty of...
详细信息
ISBN:
(纸本)9780889867048
parallel applications are notorious for their intractability to performance debugging. Automatic performance analysis techniques, such as those used by Kojak and KappaPI, are promising in alleviating the difficulty of discovering performance inefficiencies in parallel applications. However, as we show in this paper, the results produced by these tool can be potentially misleading and sometimes, outright incorrect. The reason is that the overhead due to performance inefficiencies originating at a certain point in the program can causally propagate and manifest itself at other points. Current techniques perform a flat analysis, i.e., they do not account for causal propagation. In this paper, we present a method of causal analysis that current analysis techniques can be retrofitted with to account for causal propagation of overhead to arrive at a more accurate description of performance bottlenecks. We also show various advantages rendered by this technique to improving the effectiveness of automatic performance analysis. In this paper, we only tackle overhead related to communication operations in MPI parallel application. In general, however, our technique can be used for non-communication related overhead for any parallel programming paradigm.
Nowadays, desktop machines have good features in terms of computing power, but they are still normally underused at research centers (universities, companies, etc.). On the other hand, some researchers cannot solve ve...
详细信息
ISBN:
(纸本)9780889867048
Nowadays, desktop machines have good features in terms of computing power, but they are still normally underused at research centers (universities, companies, etc.). On the other hand, some researchers cannot solve very complex problems because they lack sufficient computing power. In this paper, we propose to exploit commodity machines by using Desktop Grid computing (DGC) technology. Moreover, we employ this kind of infrastructure allowing researchers to deploy and run their applications without any code changes. The goal is to provide an on-demand customized execution environment where scientists can load and run their applications and experiments without worrying about the underlying hardware and operating systems of the client desktop machines. Our proposal achieves this objective by using a DGC technology, such as BOINC, in conjunction with a Virtual Machine technology like VMware. In this paper we introduce this new approach to DGC computing and analyze the successful results that we have obtained.
The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It allows searching for similar objects represente...
详细信息
ISBN:
(纸本)9780889866379
The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It allows searching for similar objects represented in metric spaces. The sequential EGNAT has been shown to achieve good performance in high-dimentional metric spaces with properties (not found in others of the same kind) of allowing update operations and efficient use of secondary memory. Thus, for example, it is suitable for indexing large multimedia databases. However, comparing two objects during a search can be a very expensive operation in terms of running time. This paper shows that parallelcomputing upon clusters of PCs can be a practical solution for reducing running time costs. We describe alternative distributions for the EGNAT index and their respective parallel search/update algorithms and concurrency control mechanism.
Task scheduling in heterogeneous computing environments is one of the widely studied problems in the literature most of which target on static scheduling. There is a few number of work on dynamic scheduling where they...
详细信息
ISBN:
(纸本)9780889867048
Task scheduling in heterogeneous computing environments is one of the widely studied problems in the literature most of which target on static scheduling. There is a few number of work on dynamic scheduling where they mainly target on a single objective: minimization of the schedule length without considering the effect of resource failures. The aim of this paper is two-fold. First we propose a new unified objective of dynamic scheduling problem which considers both schedule length and reliability cost of resources. Then, we present a new memetic algorithm for dynamic scheduling of independent tasks with batch mode by considering our unified objective. The experimental results reveal that makespan and reliability cost could be minimized together according to the weight of the two objectives, and our algorithm outperforms the related work given in the literature according to the unified objective, for most of the test cases.
In this paper detailed analysis of discrete state observers from the point of view of potential time expenses required for the observer computation is presented. The aim of this article is to present, what is the infl...
详细信息
ISBN:
(纸本)9780889866331
In this paper detailed analysis of discrete state observers from the point of view of potential time expenses required for the observer computation is presented. The aim of this article is to present, what is the influence of choice of observer parameters on computation time consumption. The attention is paid most of all on the analysis of the possibility of application of the control systems in a distributed version in the context of discrete state reconstruction. All of numerical tests are conducted in the LAM/MPI environment.
暂无评论