the proceedings contain 57 papers. the topics discussed include: logical topology design with traffic grooming for scheduled demands;the impact of multi-core architectures on task retrieval policies for volunteer comp...
ISBN:
(纸本)9780889867741
the proceedings contain 57 papers. the topics discussed include: logical topology design with traffic grooming for scheduled demands;the impact of multi-core architectures on task retrieval policies for volunteer computing;evaluation of CPU power control and scheduling technique on parallelcomputing environment;clustered assignment of CCQS in information monitoring system supporting conjunctive queries;dense skip graphs as an overlay for P2P networks;multi-connection and multi-core aware all-gather on infiniband clusters;an improved prioritization method for task scheduling in heterogeneous computingsystems;thread pipelining with clustered data communication on commodity CMPS;a distributed algorithm for disjoint paths in star networks;parallel algorithms for a visual text mining platform;and a cache miss analysis for multithreaded architectures.
Path planning is one of the most computation expensive tasks in the field of mobile robotics especially in dynamically changing environments. It is difficult to meet realtime requirements with serial path planning alg...
详细信息
ISBN:
(纸本)9780889867741
Path planning is one of the most computation expensive tasks in the field of mobile robotics especially in dynamically changing environments. It is difficult to meet realtime requirements with serial path planning algorithms. this would require a high speed processor. Particularly in small autonomous robot systems, this is inefficient due to the energy consumption and space requirement. In contrast, we propose a parallel path planning approach based on Marching Pixels which is a new innovative Organic computing principle. It can be used as coarse global path planner in dynamically changing environments because the algorithm is very fast and only requires few resources.
Large-scale parallel and distributedcomputing environments have several problems concerning power consumption, thermal ascent, and setting space. In particular, power consumption and thermal ascent are the two seriou...
详细信息
ISBN:
(纸本)9780889867741
Large-scale parallel and distributedcomputing environments have several problems concerning power consumption, thermal ascent, and setting space. In particular, power consumption and thermal ascent are the two serious problems that have to be taken care of when a system is used for a long time. We had proposed a CPU power control and scheduling technique (PCST) for realtime parallel and distributedcomputingsystems in order to solve the abovementioned problems;in these systems, the processors can change the frequencies and voltages. In this study, we evaluate the PCST by using the tracking program. the evaluation results show that when the PCST is employed, the power consumption is 60%-80% when compared to that of the commercial power control;moreover, when compared to that of the no power control, the power consumption is only 20%-40%.
We study the problem of scheduling tasks in a distributed system where the data (and code) for a program may reside on a processor different from the one where it will be executed. the scheduling of the tasks is compl...
详细信息
ISBN:
(纸本)9780889867741
We study the problem of scheduling tasks in a distributed system where the data (and code) for a program may reside on a processor different from the one where it will be executed. the scheduling of the tasks is complex as one must balance execution and communications times. We present an off-line polynomial time approximation algorithm for the case when the processors can be split into storage (client) and processing (server) nodes. Our algorithm is the first constant ratio approximation algorithm for this problem. then we discuss generalization of our problem as well as the on-line version of our problem.
Program analysis supporting software development is often part of edit-compile-cycles and precise program analysis is time consuming. Withthe availability parallel processing power on desktop computers, paral-lelizat...
详细信息
ISBN:
(纸本)9780889867741
Program analysis supporting software development is often part of edit-compile-cycles and precise program analysis is time consuming. Withthe availability parallel processing power on desktop computers, paral-lelization is a way to speed up program analysis. this paper introduces a parallelization schema for program analysis that can be translated to parallel machines using standard scheduling techniques. First benchmarks analyzing a number of Java programs indicate that the schema scales well for up to 8 processors, but not very well for 128 processors. these results are a first step towards more precise program analysis in Integrated Development Environments utilizing the computational power of today's custom computers.
Current visual text mining platforms are still focused on small or medium-scale datasets and sequential algorithms. However, as document collections increase in size and complexity, more computing resources are requir...
详细信息
ISBN:
(纸本)9780889867741
Current visual text mining platforms are still focused on small or medium-scale datasets and sequential algorithms. However, as document collections increase in size and complexity, more computing resources are required in order to achieve the expected interactive experience. In order to address the scalability problem, this paper proposes and evaluates parallel implementations for three critical visual text mining algorithms. Experiments withthe parallel solutions were conducted for varying dataset sizes and different numbers of processors. the results show a good speedup for the proposed solutions and indicate the potential benefits of exploring task parallelism in critical algorithms to improve scalability of an interactive visual text mining platform.
In engineering applications often real-valued performance functions must be optimized. If the performance function is discontinuous, there exist no derivations with respect to the parameters that should be optimized. ...
详细信息
ISBN:
(纸本)9780889867741
In engineering applications often real-valued performance functions must be optimized. If the performance function is discontinuous, there exist no derivations with respect to the parameters that should be optimized. thus, we can only use undirected search methods. In contrast to simple trial-and-error approaches, evolutionary strategies can extract population-based information that guide the search process and help to improve the quality of the results. the paper describes the parallel implementation of an state-of-the-art evolutionary strategy which uses the covariance adaptation operator. It proposes a communication topology for maintaining selective pressure and a master-slave scheme for fault tolerance in distributed environments which are composed of volatile resources. Experimental results demonstrate how the implementation can be adapted to specific needs and how the parallel implementation behaves in the case of resource failures.
While distributed multi-agent systems are especially suitable for taking advantage of the capacity for evolution and adaptation in ubiquitous computing, writing such programs is a difficult and complicated task if not...
详细信息
ISBN:
(纸本)9780889867741
While distributed multi-agent systems are especially suitable for taking advantage of the capacity for evolution and adaptation in ubiquitous computing, writing such programs is a difficult and complicated task if not supported by an agent programming framework. this paper presents a real-time agent service layer (RT-ASL) that is built on an existing de facto standard for interconnecting distributed objects, CORBA middleware. RT-ASL enables programmers to write distributed cooperative application programs for ubiquitous computing using a high-level abstraction of software agents. As criteria for designing RT-ASL on CORBA, we have made four important decisions regarding the message passing communication mechanism for agent communications, agent service discovery mechanism, real-time agent communication language, and real-time generic scheduling interfaces. this paper justifies the importance of such design decisions and how they can effectively deal withthe complicated difficulties.
暂无评论