{"title":"Open MP Extension for Multithreaded Computing with Dynamic SMP Processor Clusters with Communication on the Fly","authors":"A. Smyk, M. Tudruj, L. Masko","doi":"10.1109/PARELEC.2006.56","DOIUrl":"https://doi.org/10.1109/PARELEC.2006.56","url":null,"abstract":"This paper presents a possible extension of the Open MP library for programming parallel multithreaded computations in the architecture of dynamic SMP clusters with communication on the fly. Dynamic SMP clusters are composed of processors directly connected to the same local shared memory modules with the composition of the clusters arranged at program runtime. Inter-processor communication in such clusters is based on a new \"communication on the fly\" paradigm. It enables direct communication between processor data caches and eliminates many data read/write transactions concerning memory modules. New functions are presented that should be introduced to standard Open MP library to enable writing parallel multithreaded programs with communication based on the new architectural features. These functions are illustrated using the example of a program in C for parallel matrix multiplication based on data decomposition into quarters","PeriodicalId":195158,"journal":{"name":"International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115708934","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}
{"title":"Marching Pixels - Using Organic Computing Principles in Embedded Parallel Hardware","authors":"M. Komann, D. Fey","doi":"10.1109/PARELEC.2006.52","DOIUrl":"https://doi.org/10.1109/PARELEC.2006.52","url":null,"abstract":"We present an organic computing approach for very fast image processing, which we call marching pixels (MPs). Using an embedded massively-parallel array of processor elements (PEs) MPs exploit emergent algorithms in order to solve difficult tasks. They are data packets residing in specific PEs and can be seen as virtual organisms, which are born, move, unite, are mutated, leave signatures on the ground, and die on the processor field. MPs algorithms feature the desired self-x attributes and have the abilities to make image processing in a smart CMOS camera robust and fast enough. An example algorithm for object detection is outlined and evaluated concerning complexity and effectiveness","PeriodicalId":195158,"journal":{"name":"International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127349182","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}
Torsten Mehlan, Jochen Strunk, T. Hoefler, F. Mietke, W. Rehm
{"title":"IRS - A Portable Interface for Reconfigurable Systems","authors":"Torsten Mehlan, Jochen Strunk, T. Hoefler, F. Mietke, W. Rehm","doi":"10.1109/PARELEC.2006.50","DOIUrl":"https://doi.org/10.1109/PARELEC.2006.50","url":null,"abstract":"This work introduces the definition of a new interface for reconfigurable systems (IRS). Since modern FPGAs support dynamic and partial reconfiguration, new core modules may be configured during normal operation. User applications are expected to benefit from the support of current FPGA hardware. To access this hardware there is a need for a well-defined interface. This paper proposes an application programming interface (API) that meets the requirements of fast hardware access, portability and ease of use. Moreover the work explains how to implement the services for a maximum of portability","PeriodicalId":195158,"journal":{"name":"International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125740020","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}
{"title":"Energy Optimisation in Resilient Self-Stabilizing Processes","authors":"A. Kosowski, L. Kuszner","doi":"10.1109/PARELEC.2006.35","DOIUrl":"https://doi.org/10.1109/PARELEC.2006.35","url":null,"abstract":"When performing an algorithm in the self-stabilizing model, a distributed system must achieve a desirable global state regardless of the initial state, whereas each node has only local information about the system. Depending on adopted assumptions concerning the model of simultaneous execution and scheduler fairness, some algorithms may differ in stabilization time or possibly not stabilize at all. Surprisingly, we show that the class of polynomially-solvable self-stabilizing problems is invariant with respect to the assumption of weak scheduler fairness. Furthermore, for systems with a single distinguished vertex we prove a much stronger equivalence, stating that synchronisation, the existence of a central scheduler and its fairness have no influence on polynomial stabilization time","PeriodicalId":195158,"journal":{"name":"International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123598333","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}
{"title":"A Delay-Optimal Static Scheduling of DSP Applications Mapped onto Multiprocessor Architectures","authors":"A. Itradat, M. Ahmad, A. Shatnawi","doi":"10.1109/PARELEC.2006.2","DOIUrl":"https://doi.org/10.1109/PARELEC.2006.2","url":null,"abstract":"This paper presents a novel technique to obtain time schedules for cyclic DFGs representing DSP algorithms mapped onto multiprocessor systems with non-negligible inter-processor communication delays. In this paper, the question of optimizing the input/output delay in the presence of inter-processor communication overhead is addressed. The proposed technique operating on the cyclic DFG of a DSP algorithm is designed to evaluate the relative firing times of the nodes by using Floyd-Warshall's longest path algorithm so that the inter-processor communication overhead is taken into consideration to provide an optimal schedule","PeriodicalId":195158,"journal":{"name":"International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116173686","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}
{"title":"A Hardware Conceptual Prototyping of the Genetic Algorithm to Adaptive IIR Filtering","authors":"G. Rubin, K. Bielawski, J. Baszun","doi":"10.1109/PARELEC.2006.5","DOIUrl":"https://doi.org/10.1109/PARELEC.2006.5","url":null,"abstract":"This paper considers a hardware implementation of adaptive infinite impulse response filtering where a genetic algorithm is used to adapting the filter weights. A unique genetic algorithm is developed to optimize filter coefficients in adaptation process. Hardware architecture and its behaviour at simulations for DE Jong test junction was presented as well differences in interconnections with high speed IIR filter with coefficient values as a input to the filter realization. Proposed design of hardware realization of adaptive IIR filter is limited to second order filter","PeriodicalId":195158,"journal":{"name":"International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122473991","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}
{"title":"Creating a Forest of Binary Search Trees for a Multiprocessor System","authors":"S. Pushpa, P. Vinod, C. Maple","doi":"10.1109/PARELEC.2006.27","DOIUrl":"https://doi.org/10.1109/PARELEC.2006.27","url":null,"abstract":"In a multiprocessor system, a lock-based scheme is used to ensure consistency and correctness during parallel processing. To manipulate a binary search tree in parallel, a process that modifies the current state of the data structure has to lock a certain portion of the tree. Lock-based schemes result in a longer wait time for the rest of the processes, particularly if a large portion of the tree has been locked. In a concurrent environment, the root of the binary search tree may therefore become a bottleneck, as it is the only entry point for all processes. To reduce the total wait time, it is possible to create and maintain a binary search tree with multiple roots, thereby allowing multiple processors to act upon different trees simultaneously. In this paper, we present static and dynamic methods to create and maintain a binary search tree with multiple roots. Without considerable overhead, a set of connected trees is created that resembles a forest, yet acts as a single binary search tree","PeriodicalId":195158,"journal":{"name":"International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125139277","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}
{"title":"A Software Architecture Based on Multi-Agent and Grid Computing for Electric Power System Applications","authors":"Qi Huang, Kaiyu Qin, Wenyong Wang","doi":"10.1109/PARELEC.2006.9","DOIUrl":"https://doi.org/10.1109/PARELEC.2006.9","url":null,"abstract":"This paper first reviews the application of computing technology in electric power system, with emphasis on the evolution of the software architecture. And then proposes a software architecture to implement power system operation and computing. As power systems have become more complicated, software tools and simulations have played a more important role. The operation and control of the power system is actually becoming a huge data-intensive, information-intensive, communication-intensive and computing-intensive application. Power systems rely more heavily on computerized communications and control. Therefore, system security has become increasingly dependent on protecting the integrity of the associated information systems. Grid computing is generally regarded as a software technology to fully use the spare computing resources. However, the philosophy of grid computing can be used in engineering case to play an important role in power system distributed monitoring, control and distributed parallel computing. This paper proposes a software architecture, which depends on grid computing for hardware support and agent technology for software support, to seamlessly integrate the dispersed computing resources to implement high-performance operation and computing in electric power system. Some comparative test cases are studied, and the test results show that the combination of agent and grid computing can enhance the performance of the distributed computing system","PeriodicalId":195158,"journal":{"name":"International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114230429","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}
{"title":"Distributed Optimization of Temperature Field for Reliable Construction of Electronic Circuits","authors":"B. Butrylo","doi":"10.1109/PARELEC.2006.31","DOIUrl":"https://doi.org/10.1109/PARELEC.2006.31","url":null,"abstract":"Sequential and distributed implementations of optimization algorithm are validated and applied for the optimization of the temperature field distribution in electronic circuits. The approximated, analytical solution of heat transfer equation is implemented to determine the temperature distribution in the circuit. The genetic algorithm is applied in the computations of the optimal displacement of the components in the circuit. Three different methods of the task and/or domain partitioning in the distributed algorithm are discussed","PeriodicalId":195158,"journal":{"name":"International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125672625","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}
{"title":"The Use of the Dynamic Space Decomposition Algorithm of a Computational Area in Heterogeneous Cluster Computations","authors":"W. Walendziuk, S. Kwieckowski","doi":"10.1109/PARELEC.2006.81","DOIUrl":"https://doi.org/10.1109/PARELEC.2006.81","url":null,"abstract":"This article presents an algorithm of the dynamic space decomposition being used in parallel methods of numerical simulations. This algorithm decomposes a numerical model defined by a rectangular grid of material data into subareas. These subareas are then assigned to particular computational nodes of a heterogeneous cluster system during initialisation of the computational process. The present work contains an example use of the algorithm applied to decompose the computational area in parallel implementation of the FDTD (finite-difference time-domain) method. The final part of the article contains the analysis of the decomposing algorithm in the form of the achieved speedup results of the parallel programme for various densities of the finite differences grid","PeriodicalId":195158,"journal":{"name":"International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132220573","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}