2009 IEEE International Symposium on Parallel and Distributed Processing with Applications最新文献_第4页

VoIP Performance in Multi-radio Mobile Devices 多无线电移动设备中的VoIP性能

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.97

A. Iwayemi, Chi Zhou

引用次数: 1

DLBS: Duplex Loading Balancing Strategy on Object Storage System 对象存储系统的双工负载均衡策略

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.5

Tang Zhipeng, F. Dan, Tu Xudong, H. Fei

{"title":"DLBS: Duplex Loading Balancing Strategy on Object Storage System","authors":"Tang Zhipeng, F. Dan, Tu Xudong, H. Fei","doi":"10.1109/ISPA.2009.5","DOIUrl":"https://doi.org/10.1109/ISPA.2009.5","url":null,"abstract":"Typical load balancing strategies have been proved to be effective in traditional storage system in that they succeeded in providing specific algorithms on data partition and workload distribution. When comes to OBS, an Object-based Storage System, most of these strategies are hard to comply with the new feature— a smarter storage device named Object Storage Device (OSD) that is capable of expanding with upper burden to release the storage-aware jobs from distributed file systems. While more intelligent and powerful functions begin to be depolied on the OSD, such as Replication Technology, which was widely adopted by modern distributed storage systems, however, its misuse will lead to the downgrade on network bandwidth and computing performance. So load balance within Replica technique emerges as a hot issue in nowadays storage application. In this paper, we propose a Replica-based Duplex Load Balancing Strategy (DLBS) to better load balancing. In general, DLBS is a dynamic combination of an active strategy working on replica reproduction control, and another passive strategy that supervises hot-spot appearance, transfering control as well. The model puts them together in handling load balance influenced by replicas. Theoretical analysis and simulation results demonstrate that DLBS can be utilized in the real OBS system to provide more effective and efficient load balance than other methods.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130214216","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 Simple Cache Partitioning Approach in a Virtualized Environment 虚拟化环境中的简单缓存分区方法

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.47

Xinxin Jin, Haogang Chen, Xiaolin Wang, Zhenlin Wang, Xiang Wen, Yingwei Luo, Xiaoming Li

{"title":"A Simple Cache Partitioning Approach in a Virtualized Environment","authors":"Xinxin Jin, Haogang Chen, Xiaolin Wang, Zhenlin Wang, Xiang Wen, Yingwei Luo, Xiaoming Li","doi":"10.1109/ISPA.2009.47","DOIUrl":"https://doi.org/10.1109/ISPA.2009.47","url":null,"abstract":"Virtualization is often used in systems for the purpose of offering isolation among applications running in separate virtual machines (VM). Current virtual machine monitors (VMMs) have done a decent job in resource isolation in memory, CPU and I/O devices. However, when looking further into the usage of lower-level shared cache, we notice that one virtual machine’s cache behavior may interfere with another’s due to the uncontrolled cache sharing. In this situation, performance isolation cannot be guaranteed. This paper presents a cache partitioning approach which can be implemented in the VMM. We have implemented this mechanism in Xen VMM using the page coloring technique traditionally applied to the OS. Our VMM-based implementation is fully transparent to the guest OSes. It thus shows the advantages of simplicity and flexibility. Our evaluation shows that our cache partitioning method can work efficiently and improve the performance of co-scheduled applications running within different VMs. In the concurrent workloads selected from the SPEC CPU 2006 benchmarks, our technique achieves a performance improvement by up to 19% for the most sensitive workloads","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128808894","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}

引用次数: 52

Scheduling Jobs in Grids Adaptively 自适应调度网格作业

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.75

R. Chang, Chih-Yuan Lin, Chun-Fu Lin

引用次数: 3

Survivable Virtual Topology Reconfiguration Problem on WDM Networks with Reconfiguration Constraint 具有重构约束的WDM网络可生存虚拟拓扑重构问题

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.8

D. Din, Y. Chiu

{"title":"Survivable Virtual Topology Reconfiguration Problem on WDM Networks with Reconfiguration Constraint","authors":"D. Din, Y. Chiu","doi":"10.1109/ISPA.2009.8","DOIUrl":"https://doi.org/10.1109/ISPA.2009.8","url":null,"abstract":"In a emph{Wavelength Division Multiplexing} (WDM) network, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing {it virtual topology reconfiguration}. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and reconfiguration is an important issue in WDM networks. In this paper, the {it Virtual Topology Reconfiguration Problem/} ({it VTRP/}) on WDM networks with a reconfiguration constraint is studied. Given the physical topology, dedicated path-protection virtual topology and a new traffic demand matrix, the goal of VTRP is to reconfigure current virtual topology under the pre-specified reconfiguration constraint ($r$, a positive integer) so that the objective value can be minimized. The objective cost of VTRP is the {it average weighted propagation delay/} ({it AWPD/}). Because designing a polynomial time algorithm to find the optimal solution of VTRP is impractical when the reconfiguration constraint $r$ is larger, two heuristic algorithms are proposed to solve this problem. They are {it Positive Reconfiguration Heuristic Algorithm/} ({it PRHA/}) and {it Conservative Reconfiguration Heuristic Algorithm/} ({it CRHA/}). Experimental results of these algorithms are also given.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116833670","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

Managing Large-Scale Scientific Computing in Ensemble Prediction Using BPEL 使用BPEL管理集成预测中的大规模科学计算

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.105

Cancan Liu, Weimin Zhang, Zhigang Luo, X. Cao, Hai Liu

引用次数: 0

Evaluation Method of Synchronization for Shared-Memory On-Chip Many-Core Processor 片上共享内存多核处理器同步性评价方法

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.6

Fenglong Song, Zhiyong Liu, Dongrui Fan, He Huang, Nan Yuan, Lei-Ping Yu, Junchao Zhang

{"title":"Evaluation Method of Synchronization for Shared-Memory On-Chip Many-Core Processor","authors":"Fenglong Song, Zhiyong Liu, Dongrui Fan, He Huang, Nan Yuan, Lei-Ping Yu, Junchao Zhang","doi":"10.1109/ISPA.2009.6","DOIUrl":"https://doi.org/10.1109/ISPA.2009.6","url":null,"abstract":"On-chip many-core architecture is an emerging and promising computation platform. High speed on-chip communication and abundant chipped resources are two outstanding advantages of this architecture, which provide an opportunity to implement efficient synchronization scheme. The practical execution efficiency of synchronization scheme is critical to this platform. However, there are few researches on systematic evaluation method of choice synchronization schemes for on-chip many-core processors, and effect of dedicated hardware support in this context. So we focus on the evaluation method and criterion of synchronization scheme on the platform. Firstly, we present several criterions proper to on-chip many-core architecture, that is, absolute overhead of synchronization operation, the transferring time between different synchronization operations, overhead caused by load imbalance, and the network congestion caused by synchronization operation. Secondly, we illustrate how to design microbenchmarks which one dedicated to evaluate a performance criterion respectively. Finally, we implement these microbenchmarks and synchronization schemes on an on-chip many-core processor with shared level-two cache and AMD Opteron commercial chip multi-processor, respectively. And we analyze effect of dedicated hardware support. Results show that the most overhead of synchronization is caused by load imbalance and serialization on synchronization point. It also shows that synchronization scheme supported with dedicated hardware can improve its performance obviously for chipped many-core processor.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134054873","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

A Case-Based Component Selection Framework for Mobile Context-Aware Applications 面向移动上下文感知应用的基于案例的组件选择框架

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.110

Fan Dong, Li Zhang, Dexter H. Hu, Cho-Li Wang

引用次数: 7

DDSA: A Sampling and Validation Based Spectrum Access Algorithm in Wireless Networks 一种基于采样和验证的无线网络频谱接入算法

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.64

Panlong Yang, Hai Wang, Guihai Chen

{"title":"DDSA: A Sampling and Validation Based Spectrum Access Algorithm in Wireless Networks","authors":"Panlong Yang, Hai Wang, Guihai Chen","doi":"10.1109/ISPA.2009.64","DOIUrl":"https://doi.org/10.1109/ISPA.2009.64","url":null,"abstract":"Spectrum access scheme is a fundamental component in building efficient wireless networks. Conventional methods such as proactive channel assignment is costly due to large amount of protocol overhead. Also, those algorithms suffer from its inability in dealing with channel dynamics. The opportunistic methods however, spend more time on probing, and suffer from the myopic decisions as well. We present a decision based dynamic spectrum access algorithm (DDSA), which is built upon the Markov decision process (MDP), and could adaptively handle the DSA process for higher throughput. We employ quiet probing and dynamic controlling mechanisms in DDSA, so as to achieve a reduced protocol overhead and improved adaptivity. Different from previous methods, the DDSA is a model driven method, and we use the modeling technique on the IEEE 802.11 DCF for virtual channel state probing. The modeling technique could help us improve the accuracy on channel state, and reduce protocol overhead. Using a heuristic and adaptive algorithm named `hindsight optimization', we solve the hardness in computing the MDP. Moreover, under the feasibility testing and scaling processes, the validated decision can be confidentially applied for a congestion-free DSA.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129186790","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 Adaptive Scheduler for Enhancing the Efficiency of Multi-engine BPM Systems 一种提高多引擎BPM系统效率的自适应调度程序

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.78

Junyi Sun, Houfu Li, Yanbo Han

引用次数: 0