发布求助
文献互助 智能选刊 最新文献

Proceedings 2000. International Workshop on Parallel Processing最新文献

筛选
英文 中文
A jump and look all round long range image restoration and its parallelism 一个跳跃和看四周的远距离图像恢复及其并行性
Proceedings 2000. International Workshop on Parallel Processing Pub Date : 2000-08-21 DOI: 10.1109/ICPPW.2000.869114
Wen Li, David Zhang, Zhiyong Liu, X. Qiao
{"title":"A jump and look all round long range image restoration and its parallelism","authors":"Wen Li, David Zhang, Zhiyong Liu, X. Qiao","doi":"10.1109/ICPPW.2000.869114","DOIUrl":"https://doi.org/10.1109/ICPPW.2000.869114","url":null,"abstract":"An image information restoration algorithm based on long-range correlation (LR-IIRA) can be efficiently applied in image interpretation, restoration and error concealment. However, this algorithm requires excessive computing time, which restricts its application to large-scale problems and real-time problems. We propose an improved LR-IIRA, named jumping and looking all round (JL-LR-IIRA). By using this algorithm, the computing time can be reduced to 1/6 of LR-IIRA's, i.e., the computing time is 14.17 (seconds) by LR-IIRA and 2.41 (s) by JL-LR-IIRA. To reduce the processing time further, a parallel JL-LR-IIRA algorithm (PJL-LR-IIRA) to parallelize the restoration processing is proposed. In our PJL-LR-IIRA, after we analyze data distribution and communication deeply, a parallel read method and a key position technique are presented. By using our PJL-LR-IIRA on four computing nodes on the Dawning 2000 cluster system, the processing time is 0.69 (second). PJL-LR-IIRA provides a new efficient way for real-time image restoration applications. Furthermore, from theoretical analysis and experiment results, it shows that the scalability of our PJL-LR-IIRA is good. So PJL-LR-IIRA is also a new efficient way for large-scale image restoration applications.","PeriodicalId":424358,"journal":{"name":"Proceedings 2000. International Workshop on Parallel Processing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122807187","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}
引用次数: 1
Efficient multicast in heterogeneous networks of workstations 异构工作站网络中的高效组播
Proceedings 2000. International Workshop on Parallel Processing Pub Date : 2000-08-21 DOI: 10.1109/ICPPW.2000.869145
R. Libeskind-Hadas, Jeff Hartline
{"title":"Efficient multicast in heterogeneous networks of workstations","authors":"R. Libeskind-Hadas, Jeff Hartline","doi":"10.1109/ICPPW.2000.869145","DOIUrl":"https://doi.org/10.1109/ICPPW.2000.869145","url":null,"abstract":"This paper studies the problem of efficient multicast in heterogeneous networks of workstations (HNOWs) using a parameterized communication model. This model associates a sending overhead and a receiving overhead with each node as well as a network latency parameter. The problem of finding optimal multicasts in this model is known to be NP-complete in the strong sense. Nevertheless, we show that for two different properties that arise in typical HNOWs, provably near-optimal and optimal solutions, respectively, can be found in polynomial time. Specifically, we show the following two results: when the ratios of receiving overhead to sending overhead among the nodes is bounded by constants, solutions within a bounded ratio of optimal can be found in time O(nlogn). Secondly, if the number of distinct types of workstations is fixed then optimal solutions can be found in polynomial time. These results provide a practical means of finding optimal and provably near-optimal multicast schedules in a large class of frequently occurring heterogeneous networks of workstations.","PeriodicalId":424358,"journal":{"name":"Proceedings 2000. International Workshop on Parallel Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128987167","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}
引用次数: 8
Flits: pervasive computing for processor and memory constrained systems Flits:处理器和内存受限系统的普适计算
Proceedings 2000. International Workshop on Parallel Processing Pub Date : 2000-08-21 DOI: 10.1109/ICPPW.2000.869084
W. Majurski, A. Dima, M. Laamanen
{"title":"Flits: pervasive computing for processor and memory constrained systems","authors":"W. Majurski, A. Dima, M. Laamanen","doi":"10.1109/ICPPW.2000.869084","DOIUrl":"https://doi.org/10.1109/ICPPW.2000.869084","url":null,"abstract":"Many pervasive computing software technologies are targeted for 32-bit desktop platforms. However, there are innumerable 8-, 16- and 32-bit microcontroller- and microprocessor-based embedded systems that do not support the resource requirements of these technologies. We describe ongoing research that explores the feasibility of creating a portable runtime environment that is capable of executing across a wide variety of 8-, 16- and 32-bit processors and that offers mobile code and high-level language support. Our solution adapts a version of the language Forth called FCode and its environment to fit these needs. We introduce the concept of a \"flit\"-a software construct similar to an applet but tailored to the needs of lower resource solutions for pervasive computing. We also describe work currently in progress.","PeriodicalId":424358,"journal":{"name":"Proceedings 2000. International Workshop on Parallel Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114752119","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}
引用次数: 3
A component based architecture for mobile information access 基于组件的移动信息访问体系结构
Proceedings 2000. International Workshop on Parallel Processing Pub Date : 2000-08-21 DOI: 10.1109/ICPPW.2000.869089
Chaitanya Pullela, Liang Xu, D. Chakraborty, Anupam Joshi
{"title":"A component based architecture for mobile information access","authors":"Chaitanya Pullela, Liang Xu, D. Chakraborty, Anupam Joshi","doi":"10.1109/ICPPW.2000.869089","DOIUrl":"https://doi.org/10.1109/ICPPW.2000.869089","url":null,"abstract":"Implicit in today's mobile information access scenarios is the assumption that the information required by the mobile host is readily available on the network and that its location is \"known\" in a static fashion. There is a significant ongoing research on ways to overcome the problems (such as low-bandwidth or mobile networks) existing in delivering available information to mobile systems. We investigate those situations where the information required is not readily available on the network, and where it needs to be obtained by dynamically locating the required data and then possibly initiating a series of computations to obtain the information. This paper presents a layered architecture for addressing this problem generally, and also our initial implementation of this architecture.","PeriodicalId":424358,"journal":{"name":"Proceedings 2000. International Workshop on Parallel Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125602606","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
Resilient image fusion 弹性图像融合
Proceedings 2000. International Workshop on Parallel Processing Pub Date : 2000-08-21 DOI: 10.1109/ICPPW.2000.869115
T. Achalakul, Joohan Lee, Stephen Taylor
{"title":"Resilient image fusion","authors":"T. Achalakul, Joohan Lee, Stephen Taylor","doi":"10.1109/ICPPW.2000.869115","DOIUrl":"https://doi.org/10.1109/ICPPW.2000.869115","url":null,"abstract":"The paper describes a distributed spectral-screening PCT algorithm for fusing hyper-spectral images in remote sensing applications. The algorithm provides intrusion tolerance from information warfare attacks using the notion of computational resiliency. This concept uses replication to achieve fault tolerance, but goes further to dynamically regenerate replication in response to an attack or failure. The concepts of resiliency are incorporated through library technology that is application independent. This library hides the details of communication protocols required to achieve dynamic replication and reconfiguration in distributed applications. The paper provides a status report on our progress in developing the concept and applying it to image fusion. In particular it examines the performance of the PCT algorithm and compares the results with and without resiliency to assess the associated overheads.","PeriodicalId":424358,"journal":{"name":"Proceedings 2000. International Workshop on Parallel Processing","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115782828","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}
引用次数: 8
Efficient remote data access in a mobile computing environment 在移动计算环境中高效的远程数据访问
Proceedings 2000. International Workshop on Parallel Processing Pub Date : 2000-08-21 DOI: 10.1109/ICPPW.2000.869088
Laura Bright, L. Raschid
{"title":"Efficient remote data access in a mobile computing environment","authors":"Laura Bright, L. Raschid","doi":"10.1109/ICPPW.2000.869088","DOIUrl":"https://doi.org/10.1109/ICPPW.2000.869088","url":null,"abstract":"Considers the problem of remote data access for multiple clients in mobile computing environments. In this environment, a base station provides a wireless communication link between the mobile clients and remote servers that reside on a fixed network. Clients send requests to the base station for objects which reside on the remote servers. The base station downloads these objects from the remote servers and transmits them to the clients. A drawback in this environment is that remote data access across a fixed network is slow. When locally cached copies of data exist at the base station, accessing them reduces latency. However, the cached data becomes old as more recent data is made available at the remote servers. In this paper, we consider a framework that allows mobile clients to specify their preferences about recency. The objective is to maximize the recency of the data for all clients while delivering data to the clients as quickly as possible. We develop an on-demand strategy which determines when the base station should access data from the remote servers and when it should return data copies from its cache. We present analytical results that show the benefits of the on-demand approach.","PeriodicalId":424358,"journal":{"name":"Proceedings 2000. International Workshop on Parallel Processing","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134479473","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}
引用次数: 10
A conceptual model for pervasive computing 普适计算的概念模型
Proceedings 2000. International Workshop on Parallel Processing Pub Date : 2000-08-21 DOI: 10.1109/ICPPW.2000.869081
L. Ciarletta, A. Dima
{"title":"A conceptual model for pervasive computing","authors":"L. Ciarletta, A. Dima","doi":"10.1109/ICPPW.2000.869081","DOIUrl":"https://doi.org/10.1109/ICPPW.2000.869081","url":null,"abstract":"As an emerging field, pervasive computing has not had the opportunity to develop a conceptual model similar to the OSI Reference Model that is used to describe computer networks. Such a model would be useful in properly classifying design issues and providing needed context. Inspired by the layers of abstraction provided by the OSI Reference Model, we present our Layered Pervasive Computing (LPC) model to facilitate discussion and analysis of pervasive computing systems by providing a much needed conceptual framework. A key feature of our model is its representation of the human user at each layer of abstraction of the model. We then use our model to analyze a research prototype created as part of our Aroma pervasive computing project. This analysis is illustrative because it quickly reveals issues that must be addressed to realize our research prototype as a commercial product.","PeriodicalId":424358,"journal":{"name":"Proceedings 2000. International Workshop on Parallel Processing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115426985","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}
引用次数: 27
Modelling the runtime of scientific programs on parallel computers 在并行计算机上模拟科学程序的运行时
Proceedings 2000. International Workshop on Parallel Processing Pub Date : 2000-08-21 DOI: 10.1109/ICPPW.2000.869117
T. Rauber, G. Rünger
{"title":"Modelling the runtime of scientific programs on parallel computers","authors":"T. Rauber, G. Rünger","doi":"10.1109/ICPPW.2000.869117","DOIUrl":"https://doi.org/10.1109/ICPPW.2000.869117","url":null,"abstract":"Message passing programs for parallel machines with a distributed address space using communication operations of portable communication libraries such as PVM and MPI guarantee portability for most of the parallel machines available. But due to specific implementations of the runtime libraries on each specific platforms, the same program may have different runtimes on different machines, i.e., the efficiency is often not portable. Quantitative results about the runtimes of collective communication operations on specific parallel machines can therefore be helpful. We show that the execution time of collective communication operations can be modelled by runtime functions in closed form. As example, we consider the Cray T3D and T3E machines. We demonstrate that the runtime functions can be used to model the computation and communication behavior of complete programs by investigating the parallel implementation of a solution method for ordinary differential equations. As application, we consider the use of this method for solving a time-dependent reaction-diffusion equation.","PeriodicalId":424358,"journal":{"name":"Proceedings 2000. International Workshop on Parallel Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117264474","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}
引用次数: 12
Managing soft QoS requirements in distributed systems 管理分布式系统中的软QoS需求
Proceedings 2000. International Workshop on Parallel Processing Pub Date : 2000-08-21 DOI: 10.1109/ICPPW.2000.869151
G. Molenkamp, M. Katchabaw, H. Lutfiyya, M. Bauer
{"title":"Managing soft QoS requirements in distributed systems","authors":"G. Molenkamp, M. Katchabaw, H. Lutfiyya, M. Bauer","doi":"10.1109/ICPPW.2000.869151","DOIUrl":"https://doi.org/10.1109/ICPPW.2000.869151","url":null,"abstract":"Addresses the problem of soft quality-of-service (QoS) requirements for multimedia applications (e.g. distance education, telemedicine, electronic commerce). These applications need to be able to co-exist with more traditional applications for transaction and data processing and have soft real-time requirements. Unlike most other work in QoS management, we provide a framework that does not require users or application developers to have detailed knowledge of the resources needed and resource scheduling and allocation techniques in use. These underlying details are effectively hidden. In this paper, we describe our strategy, an architecture of services to support the strategy, and a prototype.","PeriodicalId":424358,"journal":{"name":"Proceedings 2000. International Workshop on Parallel Processing","volume":"84 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126104428","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
Load distribution via static scheduling and client redirection for replicated Web servers 通过静态调度和客户端重定向对复制的Web服务器进行负载分配
Proceedings 2000. International Workshop on Parallel Processing Pub Date : 2000-08-21 DOI: 10.1109/ICPPW.2000.869096
Wenting Tang, M. Mutka
{"title":"Load distribution via static scheduling and client redirection for replicated Web servers","authors":"Wenting Tang, M. Mutka","doi":"10.1109/ICPPW.2000.869096","DOIUrl":"https://doi.org/10.1109/ICPPW.2000.869096","url":null,"abstract":"Significant increases in WWW traffic motivates the need for high performance Web servers constructed from networked low cost computers. Load distribution within a distributed Web server is required to sustain high Web traffic demands. We propose an approach based on the Web servers themselves for Web server load distribution. Although it might seem counter-intuitive, we introduce an effective form of \"static scheduling\", which we call SSCR, in which each network has an associated preferable server predetermined by a static scheduler at the server site using access history. When the associated server is overloaded, the server redirects accesses to other servers temporarily. Our approach exploits temporal, spatial and geographical localities associated with Web accesses. Results from trace file simulations show improvements in load distribution and low overhead in comparison to some recently proposed approaches that use aggressive DNS TTL-based schemes. Since SSCR exploits standard features of the DNS and redirection has been supported by Web servers and browsers already, SSCR has the potential to be quickly implemented and deployed.","PeriodicalId":424358,"journal":{"name":"Proceedings 2000. International Workshop on Parallel Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130001972","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}
引用次数: 11
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书