The proceedings contain 121 papers from the Proceedings of the iastedinternationalconference on parallel and distributedcomputing and Networks, as part of the 23rd iastedinternational Multi-conference on Applied I...
详细信息
The proceedings contain 121 papers from the Proceedings of the iastedinternationalconference on parallel and distributedcomputing and Networks, as part of the 23rd iastedinternational Multi-conference on Applied Informatics. The topics discussed include: diversified transmission for wireless communication;power-efficient and QoS-aware scheduling algorithm for various traffic loads in Bluetooth;Bluetree++: a novel scatternet formation scheme;adaptive traffic load adjustment method for mesh broadband fixed wireless access systems;fast wireless authentication during roaming to AP;building virtual network management scenarios;and maintaining communication channels for migrating processes in the environment of active networks.
In this paper we present a scalable parallel refinement algorithm for tetrahedral meshes which is based on a regular refinement strategy with closure tetrahedra. This algorithm works efficiently on distributed-memory ...
详细信息
In this paper we present a scalable parallel refinement algorithm for tetrahedral meshes which is based on a regular refinement strategy with closure tetrahedra. This algorithm works efficiently on distributed-memory machines. We focus on the parallel implementation of the boundary updates of each mesh partition. Additionally we show that it is sufficient to exchange only boundary edge information between neighboring mesh partitions to obtain a conforming distributed three-dimensional tetrahedral mesh. The algorithm is implemented using the padfem2 framework.
Built from a need for modelling cognitive processes, a modular neural network is designed as the "brain" of a virtual robot moving in a prey-predator environment. The robot decides its path from the animals ...
详细信息
Built from a need for modelling cognitive processes, a modular neural network is designed as the "brain" of a virtual robot moving in a prey-predator environment. The robot decides its path from the animals it identifies around. Both a parallel implementation of distributed processes and a temporal coding of spiking neurons allow the robot to develop multimodal' perception with attentional mechanisms and to react in real-time to its dynamic environment.
The resource access and management is one of the most important key factors for grid computing. It requires a mechanism with automatically making decisions ability to support computing tasks collaborating and scheduli...
详细信息
The resource access and management is one of the most important key factors for grid computing. It requires a mechanism with automatically making decisions ability to support computing tasks collaborating and scheduling. The agent union's social activity model is one of the most suitable candidates for resource management in grid computer system. While there is no an efficient model and framework so far, this paper proposed a method for grid computing based on agent union. The method, which used agent union' s society activities as exchange and schedule foundation, has realized an efficient resource control and management framework in grid computing with media service, policy management and dynamic negotiation in agent union.
This paper revisits the interconnection of self-stabilization and fault-tolerance. Self-stabilizing algorithms are able to recover from arbitrary system states given that from some point in time on, there are no fault...
详细信息
This paper revisits the interconnection of self-stabilization and fault-tolerance. Self-stabilizing algorithms are able to recover from arbitrary system states given that from some point in time on, there are no faults. Fault-tolerance, on the other hand, refers to algorithms that cope with systems where a (bounded) part of the system (e.g. at most f out of n processes) may fail permanently. In previous work [16] we considered the interconnection of these two paradigms, i.e., algorithms that recover from arbitrary states despite of permanent faults. We have shown that in certain settings, problems as failure detection cannot be solved. This paper presents ways to circumvent this impossibility result.
This paper introduces the novel I/O benchmark PRIOmark that measures file system and disk I/O performance of modern computer systems. It characterizes the file system performance of single and distributedsystems by m...
详细信息
This paper introduces the novel I/O benchmark PRIOmark that measures file system and disk I/O performance of modern computer systems. It characterizes the file system performance of single and distributedsystems by means of two different file system interfaces. Disk I/O performance is measured using the operating system specific raw-devices. PRIOmark features the possibility of a complex workload definition in order to specify workloads for many different application domains. The output format simplifies comparability of benchmark results of different architectures. Additionally, the paper exemplarily illustrates the use of PRIOmark by comparing the file system performance of three file systems (NFS, GFS and PVFS) on a cluster with 12 processors.
Peer-to-Peer computing has emerged in the last few years as an alternative to the traditional client/server model. The Blackboard Resource Discovery Mechanism (BRDM) facilitates the discovery of objects (files) in P2P...
详细信息
Peer-to-Peer computing has emerged in the last few years as an alternative to the traditional client/server model. The Blackboard Resource Discovery Mechanism (BRDM) facilitates the discovery of objects (files) in P2P network. We show in this paper that BRDM can also be used to find idle computers in a Peer-to-Peer network and exploits their CPU cycles to work together on solving a computational problem. We analyze the performance of BRDM in comparison with other searching algorithms. The simulations show that BRDM outperforms other algorithms discovering more idle peers than other approaches with fewer number of query messages.
This paper presents and evaluates a new method for process scheduling in distributedsystems. Scheduling in distributed operating systems has a significant role in overall system performance and throughput. An efficie...
详细信息
This paper presents and evaluates a new method for process scheduling in distributedsystems. Scheduling in distributed operating systems has a significant role in overall system performance and throughput. An efficient scheduling is vital for system performance. The scheduling in distributedsystems is known as an NP-complete problem even in the best conditions, and methods based on heuristic search have been proposed to obtain optimal and suboptimal solutions. In this paper, we combine the power of genetic algorithms and simulated annealing to solve this problem considering load balancing efficiently. We evaluate the performance and efficiency of the proposed algorithm in comparison with other existing traditional and heuristic algorithms using simulation results. The proposed GA-Based algorithm has overcome the existing algorithms considering running time.
The parallelization of the bidimensional FFT-2D is considered over an heterogeneous system using master-slaves approaches. General analytical models for the parallel programming paradigm on heterogeneous networks have...
详细信息
The parallelization of the bidimensional FFT-2D is considered over an heterogeneous system using master-slaves approaches. General analytical models for the parallel programming paradigm on heterogeneous networks have been considered to tune the parallel algorithms. To obtain the optimal set of processors for a parallel execution appears in a natural way in the proposed methodology. Our proposals have been validated in an heterogeneous platform that comprises three different types of processors and an heterogeneous network.
distributed deadlock detection is one of the most important problems in distributedsystems. Over the two past decades many algorithms have been proposed in the literature to detect deadlock in distributedsystems. Al...
详细信息
distributed deadlock detection is one of the most important problems in distributedsystems. Over the two past decades many algorithms have been proposed in the literature to detect deadlock in distributedsystems. Although many of them fail to detect deadlocks or report deadlocks that does not exist (false deadlocks) and have been proved that are incorrect. The most important and applicable class of distributed deadlock detection algorithms is probe-based algorithms. In this paper existing distributed probe-based deadlock detection algorithms have been classified and a survey including correctness of them and their constraints and conditions have been introduced. Also an improvement for removing of false deadlock with considering process termination or transaction abortion in this class of algorithms has been presented.
暂无评论