Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops最新文献_第8页

Low cost parallel solutions for the VRPTW optimization problem VRPTW优化问题的低成本并行解

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951932

O. Arbelaitz, Clemente Rodríguez Lafuente

{"title":"Low cost parallel solutions for the VRPTW optimization problem","authors":"O. Arbelaitz, Clemente Rodríguez Lafuente","doi":"10.1109/ICPPW.2001.951932","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951932","url":null,"abstract":"In the paper a parallelizable system based on simulated annealing to solve vehicle routing problem with time window (VRPTW) problems is described. The system consists of two optimization phases: a global one, and local one, both based on simulated annealing and parallizable. For the first phase different parallelization strategies are presented and evaluated. The importance of the co-operation among processors has been made clear: the communication of partial solutions improves the efficiency of optimal solution's search. Two algorithms, a synchronous one and an asynchronous one, stand out due to their good average behaviour related to the quality of solutions found, and due to their stability when augmenting the number of processors. The second phase has shown to be a great complement of the global search that permits to obtain a very fast and practical, low cost parallel system. This system has been able to reach the optimal solution published for the Solomon's benchmark in an 85% of the problems, and more important, the averages of any set of random executions are less than 5% worse than the best published.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"341 1","pages":"176-181"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75939906","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 32

Restoration in IP over WDM optical networks IP over WDM光网络的恢复

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951960

Hwajung Lee, Hongsik Choi, Hyeong-Ah Choi

引用次数: 4

A differential bandwidth reservation policy for multimedia wireless networks 多媒体无线网络的差分带宽保留策略

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951985

Sunho Lim, G. Cao, C. Das

{"title":"A differential bandwidth reservation policy for multimedia wireless networks","authors":"Sunho Lim, G. Cao, C. Das","doi":"10.1109/ICPPW.2001.951985","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951985","url":null,"abstract":"Provisioning of seamless communication for mobile terminal (MT) handoffs as well as guaranteeing a certain level of quality-of-service (QoS) to ongoing connections and new connections are critical issues in multimedia wireless networks. We present a differential bandwidth reservation(DBR) algorithm that can meet these requirements. For bandwidth reservation, the DBR scheme examines a sector of cells, which are located along the way to which the MT might move. The sector of cells are further divided into two regions depending on whether they have an immediate impact on the handoff or not. Two different bandwidth reservation policies are applied to cells in the two regions to optimize the connection dropping rate while maximizing the connection acceptance rate. Two possible MT movements are analyzed using the DBR mechanism. In the first case, no knowledge of the user's moving path is assumed to be available, while in the second case, prior knowledge of a user profile is used in bandwidth reservation, and is called the user profile-based DBR (UPDBR) algorithm. Simulation results indicate that the DBR algorithm is more adaptable to optimize the system performance in terms of call dropping rate compared to prior schemes. The UPDBR scheme can exploit the MT's moving path history for better bandwidth utilization as well as reduction in the number of communication messages compared to the DBR scheme. The overall results show that the proposed schemes not only provide better performance, but also exploit the current state of the system in optimizing different performance parameters.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"10 1","pages":"447-452"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89266632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 20

Extracting SIMD parallelism from 'for' loops 从'for'循环中提取SIMD并行性

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951843

V. Gustin, P. Bulić

{"title":"Extracting SIMD parallelism from 'for' loops","authors":"V. Gustin, P. Bulić","doi":"10.1109/ICPPW.2001.951843","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951843","url":null,"abstract":"The need for multimedia applications has prompted the addition of a multimedia instruction set (MMX) to most existing general-purpose microprocessors. The introduction of short single-instruction multiple data (SIMD) i.e. \"vectorized\" instructions to the microprocessor \"scalar\" instruction set is supported by special hardware which enables the execution of one instruction on multiple data sets. Such a vectorized instruction set is primarily used in multimedia applications, and it seems likely that it will grow rapidly over the next few years. Thus on the one hand we have modern multimedia execution hardware and on the other we have the software and the general compilers which are not able to automatically exploit the multimedia instruction set. In addition, the compiler is not able to locate SIMD parallelism within a basic block. Our solution to these problems is to find statement candidates in the program written in the language C/C++ (as we mainly use this language), and to employ the SIMD instruction set in the easiest possible way. As we know that the compiler cannot be user-changed or modified, we can only extend the functionality of the program (compiler) by the use of specialised library routines or by macros. We prefer the latter. Why? We believe that the use of the macro library is faster than function calls, and we expect it to be simpler and more friendly for the user. The algorithm for identifying candidates for parallel processing (ICPP) is based on the fact that the program does not need any \"correction\" or \"adoption\" prior to being analysed andfinally to being translated into the SIMD instruction set. We define the macro library MacroVect.c as the substitution for the discovered statement candidates.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"80 1","pages":"23-28"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91036359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Improving static scheduling using inter-task concurrency measures 使用任务间并发性度量改进静态调度

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951975

C. Roig, F. Guirado, A. Ripoll, M. A. Senar, E. Luque

引用次数: 7

Parallel complete remeshing for adaptive schemes 自适应方案的并行完全重网格

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951853

Juan J. Pombo, J. C. Cabaleiro, T. F. Pena

引用次数: 7

Designing parallel sparse matrix algorithms beyond data dependence analysis 设计超越数据依赖分析的并行稀疏矩阵算法

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951838

H. Lin

{"title":"Designing parallel sparse matrix algorithms beyond data dependence analysis","authors":"H. Lin","doi":"10.1109/ICPPW.2001.951838","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951838","url":null,"abstract":"Algorithms are often parallelized based on data dependence analysis manually or by means of parallel compilers. Some vector/matrix computations such as the matrix-vector products with simple data dependence structures (data parallelism) can be easily parallelized. For problems with more complicated data dependence structures, parallelization is less straightforward. The data dependence graph is a powerful means for designing and analyzing parallel algorithm. However for sparse matrix computations, parallelization based on solely exploiting the existing parallelism in an algorithm does not always give satisfactory results. For example, the conventional Gaussian elimination algorithm for the solution of a tri-diagonal system is inherent sequential, so algorithms specially for parallel computation has to be designed. After briefly reviewing different parallelization approaches, a powerful graph formalism for designing parallel algorithms is introduced. This formalism will be discussed using a tri-diagonal system as an example. Its application to general matrix computations is also discussed and its power in designing parallel algorithms beyond the ability of data dependence analysis is shown.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"26 1","pages":"7-13"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89962559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Hot-potato routing algorithms for sparse optical torus 稀疏光环面的热土豆路由算法

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951966

Risto T. Honkanen, M. Penttonen, V. Leppänen

引用次数: 17

A general construction for nonblocking crosstalk-free photonic switching networks 无阻塞无串扰光子交换网络的一般结构

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951965

F. Hwang, Wen-Dar Lin

引用次数: 13

The improved conjugate gradient squared (ICGS) method on parallel distributed memory architectures 并行分布式存储结构的改进共轭梯度平方(ICGS)方法

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951924

L. Yang, R. Brent

{"title":"The improved conjugate gradient squared (ICGS) method on parallel distributed memory architectures","authors":"L. Yang, R. Brent","doi":"10.1109/ICPPW.2001.951924","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951924","url":null,"abstract":"For the solutions of large and sparse linear systems of equations with unsymmetric coefficient matrices, we propose an improved version of the Conjugate Gradient Squared method (ICGS) method. The algorithm is derived such that all inner products, matrix-vector multiplications and vector updates of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time of vector updates. Therefore, the cost of global communication on parallel distributed memory computers can be significantly reduced. The resulting ICGS algorithm maintains the favorable properties of the algorithm while not increasing computational costs. Data distribution suitable for both irregularly and regularly structured matrices based on the analysis of the non-zero matrix elements is also presented. Communication scheme is supported by overlapping execution of computation and communication to reduce mailing times. The efficiency of this method is demonstrated by numerical experimental results carried out on a massively parallel distributed memory system.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"1 1","pages":"161-165"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88975004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6