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

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops最新文献

筛选
英文 中文
Software solution to completely wireless presentation 软件解决方案完全无线呈现
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951987
Jingyuan Zhang, Min Zhang
{"title":"Software solution to completely wireless presentation","authors":"Jingyuan Zhang, Min Zhang","doi":"10.1109/ICPPW.2001.951987","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951987","url":null,"abstract":"Recent technology advances have made laptops tether-free, longer battery life enables a laptop to run for hours without a power cord, and wireless communication lets a laptop connect to a network without a network cable. However, in some cases, a cable is still needed to connect the laptop to a specific device. For example, a speaker has to use a video cable to connect the laptop to an overhead projector to make a presentation, although the laptop has wireless access capacity and the conference room has the wireless access point. This is mainly due to the lack of appropriate software. A lot of time is wasted connecting and disconnecting physical cable. The paper discusses a software solution which projects an application running on a laptop wirelessly onto the computer connected to an overhead projector. A prototype system has been implemented based on that idea. With this wireless presentation system, a speaker can immediately access the overhead projector without using a single physical cable. As a result the time saved is substantial.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"13 1","pages":"459-464"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84609079","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
Run-time characterization of irregular accesses applied to parallelization of irregular reductions 应用于不规则约简并行化的不规则访问的运行时特性
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951841
D. E. Singh, F. F. Rivera, María J. Martín
{"title":"Run-time characterization of irregular accesses applied to parallelization of irregular reductions","authors":"D. E. Singh, F. F. Rivera, María J. Martín","doi":"10.1109/ICPPW.2001.951841","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951841","url":null,"abstract":"Irregular reduction operations are the core of many large scientific and engineering applications. There are, in the literature, different methods to solve these operations in parallel. In this paper we discuss a new technique which improves performance significantly, both in terms of execution time and memory overhead. These improvements are achieved in the preprocessing as well as in the resulting parallel code. Our proposal is based on the use of the Irregular Access Region Descriptor (IARD). This data structure is a compact characterization of indirectly accessed arrays that can be used for the efficient parallelization of a wide spectrum of irregular codes. In this paper we present its application to parallelize irregular reduction operations.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"515 1","pages":"17-22"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75234782","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 comparison of parallel finite element and Monte Carlo methods in optical tomography 平行有限元法与蒙特卡罗法在光学层析成像中的性能比较
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951850
S. Hendrata, M. Franklin
{"title":"Performance comparison of parallel finite element and Monte Carlo methods in optical tomography","authors":"S. Hendrata, M. Franklin","doi":"10.1109/ICPPW.2001.951850","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951850","url":null,"abstract":"Optical tomography is a promising medical imaging method which uses visible light. For optical tomography, the ability to solve the \"forward problem\" plays an important role. This problem involves predicting the distribution of light intensities inside and on the surface of the object using the knowledge of the optical structure of the object and the characteristics and position of the light source. A commonly used model for light propagation in turbid media a's the diffusion equation. Two numerical methods, the Finite Element Method and the Monte Carlo Method, for solving the diffusion equation in optical tomography are presented, analyzed and compared in terms of their properties when being executed on a parallel computer system. To obtain performance predictions for both methods, processor and application performance models are developed permitting the determination of the conditions under which either one or the other method is superior.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"12 1","pages":"51-58"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73061415","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
Parallel text searching application on a heterogeneous cluster of workstations 异构工作站集群上的并行文本搜索应用
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951929
Panagiotis D. Michailidis, K. Margaritis
{"title":"Parallel text searching application on a heterogeneous cluster of workstations","authors":"Panagiotis D. Michailidis, K. Margaritis","doi":"10.1109/ICPPW.2001.951929","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951929","url":null,"abstract":"In this paper we propose a high-performance text searching implementation on a heterogeneous cluster of workstations using MPI message passing library. We test this parallel implementation and present experimental results for different text sizes and number of workstations. We also present a performance prediction model that agrees well with our experimental measurements.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"21 1","pages":"169-175"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74527027","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
A data and task parallel image processing environment for distributed memory systems 分布式存储系统的数据和任务并行图像处理环境
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951848
Cristina Nicolescu, P. Jonker
{"title":"A data and task parallel image processing environment for distributed memory systems","authors":"Cristina Nicolescu, P. Jonker","doi":"10.1109/ICPPW.2001.951848","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951848","url":null,"abstract":"The paper presents a data and task parallel low-level image processing environment for distributed memory systems. Image processing operators are parallelized by data decomposition using algorithmic skeletons. At the application level we use task decomposition, based on the Image Application Task Graph. In this way, an image processing application can be parallelized both by data and task decomposition, and thus better speed-ups can be obtained. We validate our method on the multi-baseline stereo vision application.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"7 1","pages":"39-44"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75565649","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}
引用次数: 53
Fibre-ribbon pipeline ring network with distributed global deadline scheduling and deterministic user services 具有分布式全局期限调度和确定性用户服务的光纤带状管道环网
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951967
C. Bergenhem, M. Jonsson, J. Olsson
{"title":"Fibre-ribbon pipeline ring network with distributed global deadline scheduling and deterministic user services","authors":"C. Bergenhem, M. Jonsson, J. Olsson","doi":"10.1109/ICPPW.2001.951967","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951967","url":null,"abstract":"This paper introduces a novel, fair medium access protocol for a pipelined optical ring network. The protocol provides global deadline scheduling of packets. Requests for sending packets are sent by the nodes in the network to a master node. The master uses the deadline information in the requests to determine which packet is most urgent. Arbitration is done in two steps, the collection and distribution phases. The protocol is therefore called two-cycle medium access (TCMA). The network is best suited for LANs and SANs (system area networks) such as a high speed network in a cluster of computers or in an embedded parallel computer. Offered services in this network include best effort messages, guarantee seeking messages, real-time virtual channels, functions used in parallel processing. These are possible without additional higher level protocols. A simulation analysis of the network with the protocol is presented. Further analysis shows minimum slot length and fairness of the protocol.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"82 1","pages":"311-318"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84085421","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
Providing Resource Reservations for Adaptive Applications in a Best-Effort Operating System 在最努力的操作系统中为自适应应用程序提供资源预留
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPP.2001.952097
H. Domjan, T. Gross
{"title":"Providing Resource Reservations for Adaptive Applications in a Best-Effort Operating System","authors":"H. Domjan, T. Gross","doi":"10.1109/ICPP.2001.952097","DOIUrl":"https://doi.org/10.1109/ICPP.2001.952097","url":null,"abstract":"An important class of adaptive applications can trade off one kind of resources (e.g., network bandwidth) for requests of other resources (e.g., CPU cycles). They create new challenges for operating systems: their processor demands change rapidly based on external factors, and resource requests are recurring, though non-periodic. However these applications share some of the characteristics of \"soft real-time\" tasks and are often resilient with regard to un- or under-availability of resources. This paper presents a comprehensive approach to processor management for adaptive applications, the R-Scheduler. It co-exists with a best-effort scheduler and has been implemented for NetBSD and ported to Linux. The runtime costs of admission control and scheduling are modest (below 1%). For realistic usage scenarios, the R-Scheduler allows the application to meet its time limits, whereas the traditional (default) best-effort scheduling discipline fails to allocate the CPU resources effectively.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"64 1","pages":"499-506"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81387300","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
On channel-adaptive multiple burst admission control for mobile computing based on wideband CDMA 基于宽带CDMA的移动计算信道自适应多突发接纳控制
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951983
Yu-Kwong Kwok, V. Lau
{"title":"On channel-adaptive multiple burst admission control for mobile computing based on wideband CDMA","authors":"Yu-Kwong Kwok, V. Lau","doi":"10.1109/ICPPW.2001.951983","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951983","url":null,"abstract":"Mobile computing systems built using third generation wireless standards are mostly based on the wideband CDMA platform to support high bit rate packet data services. One important component offering packet data service in CDMA is a burst admission control algorithm. We formulate the multiple-burst admission control problem as an integer programming problem, which induces our novel jointly adaptive burst admission algorithm, called the jointly adaptive burst admission-spatial dimension algorithm (JABA-SD), which is designed to effectively allocate valuable resources in wideband CDMA systems to burst requests. Both the forward link and the reverse link burst requests are considered and the system is evaluated by dynamic simulations which takes into account user mobility, power control, and soft hand-off.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"13 1","pages":"435-440"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83612501","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
Using a classifier system to improve dynamic load balancing 使用分类器系统改进动态负载平衡
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951980
J. Correa, A. Melo
{"title":"Using a classifier system to improve dynamic load balancing","authors":"J. Correa, A. Melo","doi":"10.1109/ICPPW.2001.951980","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951980","url":null,"abstract":"Dynamic load balancing is a very important problem in distributed processing. This problem aims to redistribute running processes to achieve better results according some optimization criterion. Since it is an NP-complete problem in its general formulation, it is worth using heuristics to seek better results in a reasonable time. One of the heuristics that has been successfully applied in various static scheduling problems is genetic algorithms (GAs). We propose to use a classifier system that is an adaptive system that applies a GA over a population of decision rules to achieve better decisions about when to carry out preemptive migrations in a distributed environment. The results have been impressive and the classifier system was able to surpass, without previous knowledge of the workload, the performance of a well designed analytic criterion.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"17 1","pages":"411-416"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89353598","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
Permutation capacity of WDM switching networks with limited-range wavelength conversion 波长转换范围有限的WDM交换网络的置换容量
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951961
Xiangdong Qin, Yuanyuan Yang
{"title":"Permutation capacity of WDM switching networks with limited-range wavelength conversion","authors":"Xiangdong Qin, Yuanyuan Yang","doi":"10.1109/ICPPW.2001.951961","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951961","url":null,"abstract":"The current fast-growing Internet and multimedia applications are demanding more and more network capacity every day. Wavelength division multiplexing (WDM) appears to be the solution of choice for multiplying network capacity. Wavelength conversion is the key technology in contention resolution for WDM switching networks. In this paper, we introduce a systematic approach to the analysis of the permutation capability of WDM switching networks with limited-range wavelength conversion. Such analysis requires nontrivial extensions from that of a traditional electronic switching network. Using our model we demonstrate that the performance of a WDM network with limited-range wavelength conversion is greatly improved over that of a WDM network with no wavelength conversion in terms of permutation capacity.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"43 1","pages":"271-276"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90668364","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
首页 上一页
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学术官方微信