This special issue includes the extended version of selected papers presented at the fourth parallel Architectures and Bioinspired Algorithms Workshop held in Galveston Island (TX, USA) on October 14, 2011 in conjunct...
详细信息
This special issue includes the extended version of selected papers presented at the fourth parallel Architectures and Bioinspired Algorithms Workshop held in Galveston Island (TX, USA) on October 14, 2011 in conjunction with parallel Architectures and Compilation Techniques (PACT). This workshop follows the success of the three previous workshops held in conjunction with PACT 2008 in Toronto, Canada [1], PACT 2009 in Raleigh, USA [2], and PACT 2010 in Vienna [3], Austria and the two previous Workshops on parallel Bioinspired Algorithms [4] held in Oslo, 2005, (together with IEEE internationalconference on parallel Processing (ICPP)) [5] and London, 2007 (together with Association for computing Machinery (ACM) Genetic and Evolutionary Computation conference (Gecco) 2007) [6]. These series of workshops has shown that knowledge fields such as parallel computer architectures and parallel and distributedcomputing and Bioinspired Algorithms, which could seem quite different in a first approach, are able to find transversal elements that enrich them.
Task scheduling is very important for efficient execution of large-scale workflows. Static scheduling schemes achieve high performance when executing workflows in stable environments. However, the scheduling costs are...
详细信息
Task scheduling is very important for efficient execution of large-scale workflows. Static scheduling schemes achieve high performance when executing workflows in stable environments. However, the scheduling costs are very high for large-scale workflows and they may perform poorly if the system performance is changed dynamically. Dynamic rescheduling schemes support the dynamic performance changes because tasks are rescheduled using algorithms from static scheduling schemes when the performance is changed. Thus, better performance can be achieved in workflow applications, although the scheduling costs will increase if the system performance is frequently changed. Therefore, we propose a dynamic recursive adaptive scheduling scheme (DRAS) which can reduces the computational cost. DRAS uses RAS, which is a static scheme with low cost, as rescheduling algorithm. However, if DRAS uses RAS algorithm with no change, the cost increases since RAS is called many times. Thus, we improved the RAS to eliminate the redundant computation. Furthermore, we modified RAS to improve the makespan when used for the rescheduling since DRAS may perform poorly in that case. The evaluation using an abstract simulation shows the makespan of DRAS decreases by 30%compared with a dynamic rescheduling scheme which uses the conventional RAS algorithm. Moreover, DRAS considerably reduces the scheduling time, achieving approximately 6 times speedup for workflows consisting of 1,000 tasks when the dynamic performance is frequently changed.
Due to the outstanding progress in computer technology and an ever-rising demand for high-speed processing able to support the distributed mode there is an increasing trend towards the use of parallel and distributed ...
详细信息
A modern high-performance multi-core processor has large shared cache memories. However, simultaneously running threads do not always require the entire capacities of the shared caches. Besides, some threads cause sev...
详细信息
ISBN:
(纸本)9780889867840
A modern high-performance multi-core processor has large shared cache memories. However, simultaneously running threads do not always require the entire capacities of the shared caches. Besides, some threads cause severe performance degradation by inter-thread cache conflicts and shortage of capacity on the shared cache. To achieve high performance processing on multi-core processors, effective usage of shared cache memories plays important role. In this paper, we propose a cache-aware thread scheduling policy for multi-core processors with multiple shared cache memories. The total processor performance becomes more sensitive to the cache capacity shortage, as larger caches are requested by the threads sharing one cache. The proposed policy can prevent multiple threads requesting a large cache capacity from sharing one cache. As a result, the policy can prevent inter-thread resource conflicts and hence severe performance degradation. Experimental results clearly demonstrate that the policy assists the cache partitioning mechanisms and avoids unfair performance degradation among threads. Thread scheduling based on the proposed policy can improve the performance by up to 10% and an average of 5% compared with thread scheduling without the proposed policy.
The proceedings contain 81 papers. The topics discussed include: research and implementation of distributed simulation and parallel rendering system based on grid;the study of the distributed transaction in the servic...
ISBN:
(纸本)9780769542072
The proceedings contain 81 papers. The topics discussed include: research and implementation of distributed simulation and parallel rendering system based on grid;the study of the distributed transaction in the service bearer network;an innovation of Chinese input based on android multimedia mobile device;parallel file system-supported server virtual environment in data center;a cluster-based parallel geometric correction algorithm for photogrammetry;new method for weighted coverage optimization of occlusion-free surveillance in wireless multimedia sensor network;the hierarchical threat model of routing security for wireless ad hoc networks;a distributed location based service framework of ubiquitous computing;evenness evaluation in ad-hoc sensor networks;research and application of pressure sensitive fingerprint acquisition system;and regression model in selecting network information technology companies and analyzing their business development trends.
Many large-scale scientific applications feature distributedcomputing workflows of complex structures that must be executed and transferred in shared wide-area networks consisting of unreliable nodes and links. Mappi...
详细信息
In recent years, the Elliptic Curve Cryptosystem (ECC) has attracted a great deal of attention due to its advantages. In this paper, a new ECC based scheme in a hierarchical mobile agent framework is presented. In the...
详细信息
We study the problem of gateway placement for cost minimization (GPCM) in two-dimensional wireless mesh networks. We are given a set of mesh routers, assume they have identical transmission range r, represented by uni...
详细信息
ISBN:
(纸本)9780769540597
We study the problem of gateway placement for cost minimization (GPCM) in two-dimensional wireless mesh networks. We are given a set of mesh routers, assume they have identical transmission range r, represented by unit transmission disks around them. A router may be selected as a gateway at certain placing cost. A router is served by a gateway if and only if the gateway is within its transmission range. The goal of this work is to select a set of mesh routers as gateways to serve the rest routers with minimum overall cost. This problem is NP-hard. To the best of our knowledge, no distributed algorithm with a constant approximation ratio has been given before. When all weights are uniform, the best approximation ratio is 38. We present both centralized and distributed algorithms which can achieve approximation ratios 6 + epsilon and 20 respectively. Our algorithms greatly improve the best approximation ratios.
A rapid increase of wireless networks and mobile computing applications has changed the landscape of network security. A MANET is more susceptible to the attacks than wired network. As a result, attacks with malicious...
详细信息
This paper proposes a novel platform for object locating application in the Internet of Things environment. In this platform, objects and inquirers access and query locations using uniform service entry interfaces in ...
详细信息
暂无评论