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

筛选
英文 中文
A parametrized algorithm that implements sequential, causal, and cache memory consistency 实现顺序、因果和缓存一致性的参数化算法
Ernesto Jiménez, Antonio Fernández, V. Cholvi
{"title":"A parametrized algorithm that implements sequential, causal, and cache memory consistency","authors":"Ernesto Jiménez, Antonio Fernández, V. Cholvi","doi":"10.1109/EMPDP.2002.994329","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994329","url":null,"abstract":"Presents an algorithm that implements cache coherence which can be used to implement sequential, causal or cache consistency in distributed shared memory (DSM) systems. For this purpose, it has a parameter that allows one to choose the consistency model to be implemented. In our algorithm, when implementing causal and cache consistency, all read and write operations are executed locally (i.e. they are fast). It is known that no sequential algorithm has only fast memory operations. However, in our algorithm, when implementing sequential consistency, all write operations and some read operations are fast. The algorithm uses propagation and full replication, where values written by a process are propagated to the rest of processes. This works in a cyclic-turn fashion, with each process of the DSM system broadcasting one message in turn. The values written by the process are sent within the message (instead of sending one message for each write operation), but unnecessary values are excluded. All this allows one to control the amount of message traffic due to the algorithm.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"19 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":"132816222","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}
引用次数: 22
Ambient interfaces in a Web-based theatre of work 基于网络的工作剧院中的环境接口
Tom Gross
{"title":"Ambient interfaces in a Web-based theatre of work","authors":"Tom Gross","doi":"10.1109/EMPDP.2002.994231","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994231","url":null,"abstract":"Knowledge workers typically work in both the physical world with physical artefacts and in the electronic world with electronic artefacts. At the same time they work at a number of different places and cooperate with local or remote colleagues. In this paper we introduce ambient interfaces that capture information from real and virtual environments, present information in adequate quality and quantity, provide a shared context, and support application-independent and ubiquitous availability. These ambient interfaces are integrated in the Theatre of Work Enabling Relationships environment forming a hybrid environment that offers a framework for orientation in both worlds and provides a common ground for distributed teams.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"40 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":"126774402","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}
引用次数: 13
A technique to build Ada preprocessors 一种构建Ada预处理器的技术
Javier Miranda, F. Santana, José Martín, Alexis González
{"title":"A technique to build Ada preprocessors","authors":"Javier Miranda, F. Santana, José Martín, Alexis González","doi":"10.1109/EMPDP.2002.994268","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994268","url":null,"abstract":"GNAT (GNU NYU Ada Translator) is a front-end and runtime system for Ada 95 distributed under the GNU Free Software Licence. In this paper we propose a technique to add a pre-processing phase to the GNAT front-end. This technique reduces time required to implement a high quality pre-processor and it facilitates the use of the GNAT front-end to experiment with Ada extensions. We briefly introduce the GNAT architecture and we describe our proposed technique.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"29 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":"115018000","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
A hardware-accelerated novel IR system 硬件加速的新型红外系统
M. Weeks, Victoria J. Hodge, J. Austin
{"title":"A hardware-accelerated novel IR system","authors":"M. Weeks, Victoria J. Hodge, J. Austin","doi":"10.1109/EMPDP.2002.994291","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994291","url":null,"abstract":"AURA (Advanced Uncertain Reasoning Architecture) is a generic family of techniques and implementations intended for high-speed approximate search and match operations on large unstructured datasets. This paper continues the AURA II (Advanced Uncertain Reasoning Architecture) project's research into distributed binary Correlation Matrix Memory (CMM) based upon the PRESENCE (PaRallEl Structured Neural Computing Engine) hardware architecture [14]. Previous work has described how CMMs can be seamlessly implemented onto multiple hardware PRESENCE cards to accelerate core CMM operations. To demonstrate the system, this paper describes how a novel CMM-based information retrieval (IR) system, called MinerTaur, was implemented using multiple PRESENCE cards distributed across a cluster.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"5 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":"129313345","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
A fault-tolerant reservation-based strategy for scheduling aperiodic tasks in multiprocessor systems 多处理器系统中基于容错预留的非周期任务调度策略
Chunhua Yang, Geert Deconinck
{"title":"A fault-tolerant reservation-based strategy for scheduling aperiodic tasks in multiprocessor systems","authors":"Chunhua Yang, Geert Deconinck","doi":"10.1109/EMPDP.2002.994300","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994300","url":null,"abstract":"Periodic and aperiodic tasks co-exist in many real-time systems. The periodic tasks typically arise from sensor data or control loops, while the aperiodic tasks generally arise from arbitrary events. Their time constraints need to be met even in the presence of faults. Considering the unpredictability of aperiodic tasks, this paper proposes a fault-tolerant reservation-based strategy (FTRB) to schedule aperiodic tasks by utilizing the processor time left unused by periodic tasks. The least upper bound of reserved processor time is derived analytically such that all available processor time may be exploited for servicing aperiodic tasks. Any newly arrived aperiodic task is scheduled on the first-fit processor by using an extended dynamic schedulability criterion. A primary/backup approach is used to schedule the primary and backup copy of each task on different processors to tolerate a processor failure. Our analysis and simulation results show that the processors can achieve high utilization and that the on-line implementation of aperiodic task scheduling is feasible.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"382 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":"126726117","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
The iso-level scheduling heuristic for heterogeneous processors 异构处理器的等级别调度启发式算法
Olivier Beaumont, Vincent Boudet, Y. Robert
{"title":"The iso-level scheduling heuristic for heterogeneous processors","authors":"Olivier Beaumont, Vincent Boudet, Y. Robert","doi":"10.1109/EMPDP.2002.994304","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994304","url":null,"abstract":"Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous resources. We present a new scheduling heuristic for heterogeneous processors, which improves the load-balancing achieved at each decision step while keeping a low complexity. Experimental comparisons with five heuristics taken from the literature (BIL, GDL, CPOP, HEFT and PCT) and using six classical testbeds, show very favorable results.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"23 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":"122298358","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
Wavelet packet zerotree image coding on multicomputers 多机小波包零树图像编码
M. Feil, A. Uhl
{"title":"Wavelet packet zerotree image coding on multicomputers","authors":"M. Feil, A. Uhl","doi":"10.1109/EMPDP.2002.994309","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994309","url":null,"abstract":"In this paper, we describe and analyze algorithms for advanced image coding on distributed-memory MIMD architectures. In particular, we consider a wavelet packet-based image codec using the concept of zerotree encoding. The main contribution of this work is the design of a parallel image coder composed of a wavelet packet decomposition in conjunction with the best basis algorithm followed by zerotree coding. Whereas two sensible parallelization techniques can be employed for the wavelet packet decomposition (subband-based partitioning and stripe partitioning), the zerotree coding step only allows one reasonable parallelization method (stripe partitioning). We investigate the advantages and drawbacks of all combinations and show experimental results obtained on a Siemens hpcLine cluster and a Cray T3E.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"1 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":"130645397","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
Towards the design of an automatically tuned linear algebra library 对线性代数自动调优库的设计
J. Cuenca, D. Giménez, José González
{"title":"Towards the design of an automatically tuned linear algebra library","authors":"J. Cuenca, D. Giménez, José González","doi":"10.1109/EMPDP.2002.994270","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994270","url":null,"abstract":"In this work we propose the architecture of an automatically tuned linear algebra library, which is composed by a set of linear algebra routines along with their installation routines. During the installation process on a system, the linear algebra routines will be tuned automatically to the system conditions: hardware characteristics and basic libraries used in the linear algebra routines. The design methodology is analysed with a block LU factorisation. Variants for a sequential and parallel version of this, routine on a logical rectangular mesh of processors are, considered. An analytical model of the algorithm is developed as the basis of our methodology, and the behaviour of the algorithm is analysed with message-passing using MPI on several platforms: Network of SUN workstations, SGI Origin 2000 and IBM SP2, and with, different basic linear algebra libraries: reference BLAS, machine-specific BLAS and ATLAS. The experiments show that it is possible to make a good automatic choice of configurable parameters of the linear algebra routines during the installation process. The average execution time of the linear algebra routine is reduced by about 15% with respect to the non-tuned version.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"39 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":"134448641","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}
引用次数: 13
Routing to support communication in dependable networks 路由在可靠的网络中支持通信
K. Großpietsch, E. Maehle
{"title":"Routing to support communication in dependable networks","authors":"K. Großpietsch, E. Maehle","doi":"10.1109/EMPDP.2002.994234","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994234","url":null,"abstract":"We can observe the exploding use of the Internet for various applications, ranging from ordinary E-mail exchange and all kinds of net-oriented databases, to large distributed cooperative projects. All these emerging activities heavily rely on the continuous availability of the Internet services, with regard to their proper function as well as to their timely execution. Therefore, it is felt to be extremely necessary to make especially the entire communication within the system as robust as possible. We discuss these dependability problems in detail and present a survey of research approaches to deal with them. Thereby, the focus of attention is the discussion of routing, ie, the propagation of information between non-adjacent nodes, at three levels of the Web communication: in local networks connected to server nodes, in the server machines, and in the \"network of networks\" itself.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"31 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":"132407469","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
An implementational study of certain heuristics for the performance enhancements of AODV AODV性能增强的启发式实现研究
Shailendra M. Tripathi, R. Ghosh
{"title":"An implementational study of certain heuristics for the performance enhancements of AODV","authors":"Shailendra M. Tripathi, R. Ghosh","doi":"10.1109/EMPDP.2002.994319","DOIUrl":"https://doi.org/10.1109/EMPDP.2002.994319","url":null,"abstract":"We propose and investigate a number of heuristics for enhancements of the performance of the ad hoc on-demand distance vector (AODV) routing protocol for mobile ad hoc networks. These include: (i) the utilization of location information to localize flooding during a route discovery; (ii) the utilization route caches at intermediate nodes for route discovery; (iii) a scheme for maintaining alternative paths to destination; and (iv) an aggressive local repair scheme for re-establishing a broken route. All the heuristics were implemented along with the latest version of the AODV protocol proposal, and simulated using the ns-2 simulator. For the purpose of analyzing the performance three different metrics, namely, packet delivery fraction, average delay and routing load, have been employed. Furthermore, in order to get a realistic insight into the effects of the proposed heuristics, the performance metrics have been evaluated in the presence of both low and high packet rate traffic and over three different mobility, ranges, namely, high, moderate, and low.","PeriodicalId":126071,"journal":{"name":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","volume":"176 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":"133605820","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
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学术官方微信