Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing最新文献

筛选
英文 中文
Implementation of artificial neural networks on a reconfigurable hardware accelerator 人工神经网络在可重构硬件加速器上的实现
Mario Porrmann, U. Witkowski, Heiko Kalte, U. Rückert
{"title":"Implementation of artificial neural networks on a reconfigurable hardware accelerator","authors":"Mario Porrmann, U. Witkowski, Heiko Kalte, U. Rückert","doi":"10.1109/EMPDP.2002.994279","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994279","url":null,"abstract":"The hardware implementations of three different artificial neural networks are presented. The basis for the implementations is the reconfigurable hardware accelerator RAPTOR2000, which is based on FPGAs. The investigated neural network architectures are neural associative memories, self-organizing feature maps and basis function networks. Some of the key implementation issues are considered. In particular, the resource efficiency and performance of the presented realizations are discussed.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124359132","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}
引用次数: 38
Parallel simulated annealing for the vehicle routing problem with time windows 带时间窗车辆路径问题的并行模拟退火
Z. Czech, Piotr Czarnas
{"title":"Parallel simulated annealing for the vehicle routing problem with time windows","authors":"Z. Czech, Piotr Czarnas","doi":"10.1109/EMPDP.2002.994313","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994313","url":null,"abstract":"A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some well-known instances of the problem by using parallelism. The empirical evidence indicate that parallel simulated annealing can be applied with success to bicriterion optimization problems.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124946838","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}
引用次数: 187
Grid computing and web services: a natural partnership 网格计算和web服务:自然的伙伴关系
Ian T Foster
{"title":"Grid computing and web services: a natural partnership","authors":"Ian T Foster","doi":"10.1109/EMPDP.2002.994221","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994221","url":null,"abstract":"rid computing has emerged as an important new field, distinguished from conventional distributed computing by its focus on large-scale resource sharing, innovative applications, and, in some cases, high-performance orientation. Grid technologies support flexible, secure, coordinated resource sharing among dynamic collections of individuals, institutions, and resources. While these technologies are seeing widespread use in domains as diverse as distributed data analysis, group collaboration, and science portals, we may reasonably ask how these technologies relate to the commodity “Web Services” that underlie many contemporary industrial developments. In this talk, I elucidate these relationships and propose specific steps that can be taken to enhance the functionality and flexibility of Web Services by integrating Grid concepts and technologies. G","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"87 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128949365","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}
引用次数: 2
Performance sensitivity of routing algorithms to failures in networks of workstations with regular and irregular topologies 规则和不规则拓扑工作站网络中路由算法对故障的性能敏感性
J. Sancho, A. Robles, J. Duato
{"title":"Performance sensitivity of routing algorithms to failures in networks of workstations with regular and irregular topologies","authors":"J. Sancho, A. Robles, J. Duato","doi":"10.1109/EMPDP.2002.994237","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994237","url":null,"abstract":"Networks of workstations (NOWs) provide a cost-effective alternative to parallel computers. Components in NOWs may fail, degrading the network operation until the faults are repaired. In this paper, we analyze the influence of both switch and link failures on the network performance. In particular, given that network performance in NOWs strongly depends on the applied routing algorithm, we quantify the sensitivity to failures of two routing algorithms: flexible routing and up*/down* routing algorithms. In the case of up*/down* routing, two methodologies to compute routing tables are evaluated. Evaluation results modeling a Myrinet network show that, in general, up*/down* routing is more robust to failures, although its behavior strongly depends on the type of network topology, regular or irregular, and the methodology used to compute routing tables. However, the flexible routing algorithm presents a better performance, regardless of the network topology, even in presence of failures, but at expense of a larger sensitivity.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127675871","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}
引用次数: 0
BSCW: cooperation support for distributed workgroups BSCW:分布式工作组的协作支持
K. Klockner
{"title":"BSCW: cooperation support for distributed workgroups","authors":"K. Klockner","doi":"10.1109/EMPDP.2002.994290","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994290","url":null,"abstract":"The idea to use the World-Wide Web as a platform for the design and implementation of telecooperation applications is not new but there are only a few prototypes in use outside the research environment. In recent years the World Wide Web (WWW) has achieved a widespread use in commerce and industry as well as for educational purposes. Though, originally, the WWW was intended primarily for the distribution of information, it can be used successfully for enabling, and supporting cooperative work This paper describes a cooperation environment that uses the World Wide Web as a platform for communication and offers a number of functions for supporting collaboration in an workgroup environment. The basic idea is to provide the cooperation partners with a shared workspace on the Internet. Users perform their cooperation activities via this workspace by means of the standard WWW browsers. Furthermore, the system offers additional functions such as information about events and processes occurring in a workspace. The system provides cross-platform collaboration services to groups using existing Web technologies.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115618122","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}
引用次数: 7
FPGA based coprocessor to calculate the energy of dipolar system 基于FPGA的双极系统能量计算协处理器
G. Danese, I. Lotto, F. Leporati, A. Spelgatti
{"title":"FPGA based coprocessor to calculate the energy of dipolar system","authors":"G. Danese, I. Lotto, F. Leporati, A. Spelgatti","doi":"10.1109/EMPDP.2002.994276","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994276","url":null,"abstract":"In this paper, an FPGA-based coprocessor is presented, interfaced with the CPU to a computer through a PCI bus. It allows a faster evaluation of the energy of a crystal, which, computationally, is usually the heaviest part of a liquid-crystal Monte Carlo simulation of a dipolar system. The work is part of a global project aiming to design and build a parallel system made up of a cluster of accelerated workstations communicating via one of the most advanced modern network technologies. First estimations of performance show a big acceleration with respect to the execution of the same application on an Intel CPU-based motherboard.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123856529","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
Reducing energy consumption in a clustered MANET using the intra cluster data-dissemination protocol (Icdp) 使用集群内数据传播协议(Icdp)降低集群MANET的能耗
Juan-Carlos Cano, P. Manzoni
{"title":"Reducing energy consumption in a clustered MANET using the intra cluster data-dissemination protocol (Icdp)","authors":"Juan-Carlos Cano, P. Manzoni","doi":"10.1109/EMPDP.2002.994322","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994322","url":null,"abstract":"An efficient and reliable solution to data broadcasting is hard to obtain. Reliable energy-efficient data broadcasting is even harder to obtain when dealing with wireless networks where battery energy is a limited resource. We present a study which evaluates different power aware approaches to provide reliable broadcasting in a dynamic MANET. We present the intra-cluster data-dissemination protocol (Icdp). The Icdp is used to group nodes around a special one, called the cluster leader (CL). The CL centralizes the power management mechanism and acts as a proxy for data transfer between the cluster and the rest of the nodes in the region. When a cluster node enables the power management it goes into \"sleep\" mode, to minimize power consumption. The CL buffers data frames for power saving stations and delivers them on station request. We periodically distribute the cluster leader role among all the nodes inside the cluster to not overload a single node. We compare few different traffic broadcasting policies and evaluate their impact comparing Icdp to a classical IEEE 802.11 scheme. We show that in constant bit rate (CBR) and variable bit rate (VBR) cases, we can save up to 30% of NIC's energy, while preserving packet end-to-end delay and packet loss rate values.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124315951","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
PSFGA: a parallel genetic algorithm for multiobjective optimization PSFGA:多目标优化的并行遗传算法
F. D. Toro, J. Ortega, Javier Fernández, A. F. Díaz
{"title":"PSFGA: a parallel genetic algorithm for multiobjective optimization","authors":"F. D. Toro, J. Ortega, Javier Fernández, A. F. Díaz","doi":"10.1109/EMPDP.2002.994315","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994315","url":null,"abstract":"This paper presents the parallel single front genetic algorithm (PSFGA), a parallel Pareto-based algorithm for multiobjective optimization problems based on an evolutionary procedure. In this procedure, a population of solutions is sorted with respect to the values of the objective functions and partitioned into subpopulations which are distributed among the processors. Each processor applies a sequential multiobjective genetic algorithm that we have devised (called single front genetic algorithm, SFGA) to its subpopulation. Experimental results are provided comparing PSFGA with previously proposed multiobjective evolutionary algorithms.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117088334","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}
引用次数: 58
SALSART - a Web based cooperative environment for offline real-time schedule design SALSART——基于Web的离线实时调度设计协同环境
G. Fohler, D. Isovic, T. Lennvall, R. Vuolle
{"title":"SALSART - a Web based cooperative environment for offline real-time schedule design","authors":"G. Fohler, D. Isovic, T. Lennvall, R. Vuolle","doi":"10.1109/EMPDP.2002.994233","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994233","url":null,"abstract":"We present SALSART, a Web-based cooperative environment for the design of real-time schedules. It comprises a set of standalone tools interacting via an Internet-based central supervisor. It envisions a set of experts working as a geographically separated team on application specification, scheduling, editing, simulation and analysis of real-time schedules. Acknowledging the complexity of the scheduling problem and engineering constraints will prevent \"one shot\" solutions satisfying all demands, the tool suite supports the editing, modification, and cooperative rescheduling and redesign of solutions. These steps can be performed in isolation, or in an interactive way, providing for Web-based communication and graphical redesign within the team. The SALSART interactive tools are implemented in JAVA for platform independence and use XML for interfacing. Thus, it can be applied on a variety of systems and provides for configurable application demands.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114413641","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}
引用次数: 4
Efficient implementation of cellular algorithms on reconfigurable hardware
P. Corsonello, G. Spezzano, G. Staino, D. Talia
{"title":"Efficient implementation of cellular algorithms on reconfigurable hardware","authors":"P. Corsonello, G. Spezzano, G. Staino, D. Talia","doi":"10.1109/EMPDP.2002.994273","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994273","url":null,"abstract":"Reconfigurable architectures represent an innovative approach to the computer system design paradigm, which tries to cope with a problem of inefficiency of conventional computing systems, due to their general purpose nature. On the other hand, cellular automata are attractive computing models due to their fine grain parallelism, simple computational structures and local communication patterns. The inherently parallel cellular automata model is well suited to be implemented on reconfigurable hardware architectures such as field programmable gate arrays (FPGA) that can provide significant speedup. This paper describes the CAREM system that provides an efficient implementation of cellular automata algorithms on FPGA systems exploiting their reconfigurable features for executing different cellular automata rules. Its application to an image processing application and a forest fire simulation are presented and discussed. Performance evaluation and comparison with different implementations of cellular automata are presented.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131040404","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}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信