In most of compilers, the goal of traditional instruction scheduling algorithms is to improve performance in terms of execution time. This can be done by some well-known ways such as superblock scheduling, hyperblock ...
详细信息
In most of compilers, the goal of traditional instruction scheduling algorithms is to improve performance in terms of execution time. This can be done by some well-known ways such as superblock scheduling, hyperblock scheduling, and treegion scheduling. These scheduling strategies focus mainly on increasing performance through increasing the amount of instruction-level parallelism in program code. However, in VLIW (very long instruction word) architectures, an instruction word consists of a variable number of individual instructions. Therefore the step power and peak power consumption vary significantly depending on the parallel schedule generated by compiler. Power variation reduction without losing execution speed is an important scheduling constraint for embedded VLIW architectures. In this talk, we introduce some power-aware scheduling strategies for VLIW processors. These scheduling methods include: i) low power scheduling for basic blocks with integer programming; ii) modulo and software pipelining for loops; iii) register allocation and cache reuse for power reduction. With these techniques, switch activities between instructions can be minimized so that power consumption can be reduced significantly.
We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel algorithms are implemented in Java usin...
详细信息
We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel algorithms are implemented in Java using threads. Best efficiency is achieved by solving the problem of task scheduling by using task pools.
Formal concept analysis has been considered as a methodology in data mining. This paper suggests an idea that generates concept lattices in terms of isomorphic formal contexts in order to support data mining or knowle...
详细信息
Formal concept analysis has been considered as a methodology in data mining. This paper suggests an idea that generates concept lattices in terms of isomorphic formal contexts in order to support data mining or knowledge discovery. Hereby, it sets up a distributed knowledge model, which declines the time complexity of algorithms for constructing concept lattices. The paper discusses the details of algorithms for isomorphic generating of concept lattices.
In this paper, the problems of current Web search engines are analyzed, and the need for a new design is justified. Some ideas on how to improve current Web search engines are presented, and then an adaptive method fo...
详细信息
In this paper, the problems of current Web search engines are analyzed, and the need for a new design is justified. Some ideas on how to improve current Web search engines are presented, and then an adaptive method for Web meta-search engines with a multi-agent specially the mobile agents is presented to make search engines work more efficiently. In the method, the cooperation between stationary and mobile agents is used to make more efficiency. The meta-search engine gives the user needed documents based on the multi-stage mechanism. The merge of the results obtained from the search engines in the network is done in parallel. Using a reduction parallel algorithm, the efficiency of this method is increased. Furthermore, a feedback mechanism gives the meta-search engine the user's suggestions about the found documents, which leads to a new query using a genetic algorithm. In the new search stage, more relevant documents are given to the user. The practical experiments were performed in Aglets programming environment. The results achieved from these experiments confirm the efficiency and adaptability of the method
This paper presents a hierarchical and distributed reactive power optimization and control scheme which is characterized by distributed and parallel optimization algorithm. There are 2 levels in the scheme; each conta...
详细信息
This paper presents a hierarchical and distributed reactive power optimization and control scheme which is characterized by distributed and parallel optimization algorithm. There are 2 levels in the scheme; each contains a set of agents. Level 1 is composed by the local control agents (CA). Level 2 consists of the distributed and parallel optimization agents (OA). The purpose is to propose a real-time system. When constraint violations of reactive power or voltage occur, CA acts first so as to reduce the violations to the minimum. After OA receives data transmitted by CA, optimal reactive power flow computation is conducted at regular intervals. Considering that OA always responses slower to the local variable changes than CA, CA can eliminate or alleviate some bus violations quickly, and OA therefore requires less computation time than usual. To get a further speedup, special control strategies are introduced, in which OA takes all the variables as continuous variables, while CA deals with the discrete variables. The simulation results show the validity of the proposed scheme
In this paper we consider the problem of embedding a (guest) graph into a grid with the same number of nodes as those of the guest graph with minimum edge congestion. We show that a graph which has some efficient recu...
详细信息
In this paper we consider the problem of embedding a (guest) graph into a grid with the same number of nodes as those of the guest graph with minimum edge congestion. We show that a graph which has some efficient recursive separators can be embedded into a grid of the same size with small congestion. Our results imply that an N-node planar graph with maximum vertex degree /spl Delta/ can be embedded into an N-node grid with congestion O (/spl Delta//sup 2/ log N), and if the graph is a tree, then it can be embedded into an N-node grid with congestion O(/spl Delta/). The congestion for trees is optimal within a constant factor, and the congestion for planar graphs is optimal within an O(min{/spl Delta//sup 2/ /spl radic/log N, /spl Delta/ log N}) factor.
For efficient video data management, 'video data mining' is required to discover 'semantic patterns' which are not only previously unknown and interesting, but also associated with semantically relevan...
详细信息
For efficient video data management, 'video data mining' is required to discover 'semantic patterns' which are not only previously unknown and interesting, but also associated with semantically relevant events ('semantic events') in movies. In order to extract semantic patterns from a movie, we firstly represent it as a multi-stream of raw level metadata that abstracts the semantic information of the movie. Then, regarding to the temporal characteristic of the semantic event of the movie, we extract sequential patterns which are obtained by connecting temporally close and strongly associated symbols in the multi-stream of raw level metadata. We also propose a parallel data mining method in order to reduce the expensive computational cost. Finally, we verify whether the extracted patterns can be considered as semantic patterns or not.
In this paper, we present a refinement of the BSP (bulk synchronous parallel) cost model, in order to allow a more exact prediction of the parallel algorithms communication cost. Our approach is based on two point: (I...
详细信息
In this paper, we present a refinement of the BSP (bulk synchronous parallel) cost model, in order to allow a more exact prediction of the parallel algorithms communication cost. Our approach is based on two point: (I) a deepening of the benchmarks to take into account all influential factors on the word sending cost in a communication; and (II) a more elaborate manner of prediction which carefully detects the communications course context of the algorithms to be predicted
Following the knowledge provided by the theory of programming, we present an abstract syntax of the membrane systems, and their semantics. We define an appropriate notion of configurations, and sets of inference rules...
详细信息
Following the knowledge provided by the theory of programming, we present an abstract syntax of the membrane systems, and their semantics. We define an appropriate notion of configurations, and sets of inference rules corresponding to the three stages of an evolution step in membrane systems. A notion of bisimulation is defined; bisimulation relations allow to compare the evolution behaviour of two membrane systems. On the other hand, the practice of programming related to membrane systems is given by the presentation of some sequential and parallel software simulators, emphasizing their specific features.
Metaheuristics are approximate algorithms that are able to find very good solutions to hard combinatorial optimization problems. They do, however, offer a wide range of possibilities for implementations of effective r...
详细信息
Metaheuristics are approximate algorithms that are able to find very good solutions to hard combinatorial optimization problems. They do, however, offer a wide range of possibilities for implementations of effective robust parallel algorithms which run in much smaller computation times than their sequential counterparts. We present four slightly differing strategies for the parallelization of an extended GRASP with ILS heuristic for the mirrored traveling tournament problem. Computational results on widely used benchmark instances, using a varying number of processors, illustrate the effectiveness and the scalability of the different strategies. These low communication cost parallel heuristics not only find solutions faster, but also produce better quality solutions than the best known sequential algorithm.
暂无评论