2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum最新文献

筛选
英文 中文
Online Scheduling with Migration Cost 带迁移成本的在线调度
Shuangquan Yang
{"title":"Online Scheduling with Migration Cost","authors":"Shuangquan Yang","doi":"10.1109/IPDPSW.2012.268","DOIUrl":"https://doi.org/10.1109/IPDPSW.2012.268","url":null,"abstract":"In this paper, we consider a new variation of the classical online scheduling problem. In our model, an online scheduler is allowed to migrate the assigned jobs to different machines. Live migration is a powerful tool for load balancing. However, migration will incur additional cost in the destination machines. In this paper, we study the scheduling problem with migration cost model. Suppose that a job with processing time p which is already scheduled on the machine A is removed and transferred to the machine B, the load of the machine A will decrease p, but the load of the machine B will increase (1+ r) p, where 0 ≤ r ≤ 1 is a constant and it is called the migration factor. First, we propose an approximation algorithm for arbitrary machines. Then we give an improved algorithm for the case of two machines. Both algorithms are better than list scheduling algorithm [2] if the migration factor is smaller than a certain value. Finally, we implement our algorithms both in real data and random data. The experimental results indicate that the performances of algorithms are very close to the optimal algorithm.","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121586426","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
Probabilistic Brain Fiber Tractography on GPUs 基于gpu的概率脑纤维束图
Mo Xu, Xiaorui Zhang, Yu Wang, Ling Ren, Ziyu Wen, Yi Xu, G. Gong, Ningyi Xu, Huazhong Yang
{"title":"Probabilistic Brain Fiber Tractography on GPUs","authors":"Mo Xu, Xiaorui Zhang, Yu Wang, Ling Ren, Ziyu Wen, Yi Xu, G. Gong, Ningyi Xu, Huazhong Yang","doi":"10.1109/IPDPSW.2012.92","DOIUrl":"https://doi.org/10.1109/IPDPSW.2012.92","url":null,"abstract":"Diffusion Tensor Magnetic Resonance Imaging (DT-MRI) is an emerging technique that explores the structural connectivity of the human brain. The probabilistic fiber tractography based on DT-MRI data behaves more robustly than deterministic approaches in the presence of fiber crossings, but requires more prohibitive computational time. In this work we present a GPU-based probabilistic framework for brain fiber tractography. The framework includes two main steps: 1) Markov-Chain Monte-Carlo (MCMC) sampling, and 2) probabilistic streamlining fiber tracking. We implement the Metropolis-Hastings sampling for local parameter estimation on GPU. In the probabilistic streamlining fiber tracking, we find that fiber lengths are exponentially distributed, and propose a novel segmenting strategy to improve the load balance. On mid-range GPUs, we achieve performance gains up to 34x and 50x over CPUs for the two steps respectively.","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126316602","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
A Monte-Carlo Approach for Full-Ahead Stochastic DAG Scheduling 全超前随机DAG调度的蒙特卡罗方法
Wei Zheng, R. Sakellariou
{"title":"A Monte-Carlo Approach for Full-Ahead Stochastic DAG Scheduling","authors":"Wei Zheng, R. Sakellariou","doi":"10.1109/IPDPSW.2012.8","DOIUrl":"https://doi.org/10.1109/IPDPSW.2012.8","url":null,"abstract":"In most heterogeneous computing systems, there is a need for solutions that can cope with the unavoidable uncertainty in individual task execution times, when scheduling DAGs. When such uncertainties occur, static DAG scheduling approaches may suffer, and some rescheduling may be necessary. Assuming that the uncertainty in task execution times is modelled in a stochastic manner, then we may be able to use this information to improve static DAG scheduling considerably. In this paper, a novel DAG scheduling approach is proposed to solve this stochastic scheduling problem, based on a Monte-Carlo method. The approach is built on the top of a classic static scheduling heuristic and evaluated through extensive simulation. Empirical results show that a significant improvement on average application performance can be achieved by the proposed approach at a reasonable execution time cost.","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126017307","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
Autonomous and Energy-Aware Management of Large-Scale Cloud Infrastructures 大规模云基础设施的自主和能源感知管理
Eugen Feller, C. Morin
{"title":"Autonomous and Energy-Aware Management of Large-Scale Cloud Infrastructures","authors":"Eugen Feller, C. Morin","doi":"10.1109/IPDPSW.2012.322","DOIUrl":"https://doi.org/10.1109/IPDPSW.2012.322","url":null,"abstract":"With the advent of cloud computing and the need for increasing amount of computing power, cloud infrastructure providers are now facilitating the deployment of large-scale data centers. In order to efficiently manage such environments three important properties have to be fulfilled by their resource management frameworks: (1) scalability, (2) autonomy (i.e. self-organization and healing), (3) energy-awareness. However, existing open-source cloud management stacks (e.g. Eucalyptus, Nimbus, Open Nebula, Open Stack) have a high degree of centralization and limited power management support. In this context, this PhD thesis focuses on more scalable, autonomic, and energy-aware resource management frameworks for large-scale cloud infrastructures. Particularly, a novel virtual machine (VM) management system based on a self-organizing hierarchical architecture called Snooze is proposed. In order to conserve energy, Snooze automatically transitions idle servers into a low-power mode (e.g. suspend). To favor idle times the system integrates a nature-inspired VM consolidation algorithm based on the Ant Colony Optimization (ACO).","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121083232","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
A Novel Semantic Web Service Configuration Approach 一种新的语义Web服务配置方法
Mingrui Wang, Min Liu
{"title":"A Novel Semantic Web Service Configuration Approach","authors":"Mingrui Wang, Min Liu","doi":"10.1109/IPDPSW.2012.282","DOIUrl":"https://doi.org/10.1109/IPDPSW.2012.282","url":null,"abstract":"Describing and verifying Web services using formal method in Web service configuration are a hot research. According to relevant semantics of configuration elements of Web service ontology, π-calculus was applied as formal tool to describe and model Web services configuration. The dynamic behaviors of the established model could be verified and configuration errors such as deadlocks could be detected in advance, as a result the configuration duration was decreased and runtime failure was avoided. After verification, we select the optimization QoS path to complete the configuration using QPSO. Finally, the experiments results prove the soundness and correctness of our model and algorithm.","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121124308","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
Non-Cooperative Gaming and Bidding Model Based Resource Allocation in Virtual Machine Environment 基于非合作博弈和竞价模型的虚拟机资源分配
Jian Wan, D. Deng, Congfeng Jiang
{"title":"Non-Cooperative Gaming and Bidding Model Based Resource Allocation in Virtual Machine Environment","authors":"Jian Wan, D. Deng, Congfeng Jiang","doi":"10.1109/IPDPSW.2012.270","DOIUrl":"https://doi.org/10.1109/IPDPSW.2012.270","url":null,"abstract":"In this paper, we study resource allocation strategy about the virtualized servers. Based on a non-cooperative game theory, we employ bidding model to solve the resource allocation problem in virtualized servers with multiple instances competing for resources. The optimal response function of utility function which we introduced makes every player bidding prices reasonable. Although utility function is not well-defined at the point of zero, we show that the bidding game still has a unique equilibrium point. In our model, recourses are well allocated to every virtual machine and the utilization of virtual resources is improved.","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116097780","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
Mixed Data-Parallel Scheduling for Distributed Continuous Integration 分布式持续集成的混合数据并行调度
Olivier Beaumont, N. Bonichon, Ludovic Courtès, E. Dolstra, Xavier Hanin
{"title":"Mixed Data-Parallel Scheduling for Distributed Continuous Integration","authors":"Olivier Beaumont, N. Bonichon, Ludovic Courtès, E. Dolstra, Xavier Hanin","doi":"10.1109/IPDPSW.2012.7","DOIUrl":"https://doi.org/10.1109/IPDPSW.2012.7","url":null,"abstract":"In this paper, we consider the problem of scheduling a special kind of mixed data-parallel applications arising in the context of Continuous Integration. Continuous integration (CI) is a software engineering technique, which consists in re-building and testing interdependent software components as soon as developers modify them. The CI tool is able to provide quick feedback to the developers, which allows them to fix the bug soon after it has been introduced. The CI process can be described as a DAG where nodes represent package build tasks, and edges represent dependencies among these packages, build tasks themselves can in turn be run in parallel. Thus, CI can be viewed as a mixed data-parallel application. A crucial point for a successful CI process is its ability to provide quick feedback. Thus, make span minimization is the main goal. Our contribution is twofold. First we provide and analyze a large dataset corresponding to a build DAG. Second, we compare the performance of several scheduling heuristics on this dataset.","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116755731","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
Distributed Systems with Wireless Sensor Networks 具有无线传感器网络的分布式系统
N. Rodriguez, Silvana Rossetto
{"title":"Distributed Systems with Wireless Sensor Networks","authors":"N. Rodriguez, Silvana Rossetto","doi":"10.1109/IPDPSW.2012.159","DOIUrl":"https://doi.org/10.1109/IPDPSW.2012.159","url":null,"abstract":"Conventional distributed system courses follow a syllabus in which a list of topics is discussed independently and at different levels of abstractions. We propose to use a wireless sensor network environment to pin all topics down to concrete applications and to maintain issues such as fault tolerance and coordination continuously present. We describe a syllabus with eight conceptual modules, each of them associated to a hands-on experience with wireless sensor networks, which may be assigned either as homework or as a hands-on class, depending on the number of classroom hours that are available.","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125274477","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
Investigating Memory Optimization of Hash-index for Next Generation Sequencing on Multi-core Architecture 面向下一代多核排序的哈希索引内存优化研究
Wendi Wang, Wen Tang, Linchuan Li, Guangming Tan, Peiheng Zhang, Ninghui Sun
{"title":"Investigating Memory Optimization of Hash-index for Next Generation Sequencing on Multi-core Architecture","authors":"Wendi Wang, Wen Tang, Linchuan Li, Guangming Tan, Peiheng Zhang, Ninghui Sun","doi":"10.1109/IPDPSW.2012.83","DOIUrl":"https://doi.org/10.1109/IPDPSW.2012.83","url":null,"abstract":"Next Generation Sequencing (NGS) is gaining interests due to the increased requirements and the decreased sequencing cost. The important and prerequisite step of most NGS applications is the mapping of short sequences, called reads, to the template reference sequences. Both the explosion of NGS data with over billions of reads generated each day and the data intensive computations pose great challenges to the capability of existing computing systems. In this paper, we take a hash index based algorithm (PerM) as an example to investigate the optimization approaches for accelerating NGS reads mapping on multi-core architectures. First, we propose a new parallel algorithm that reorders bucket access in hash index among multiple threads so that data locality in shared cache is improved. Second, in order to reduce the number of empty hash bucket, we propose a serialized hash index compression algorithm, which coincides with the sequential access nature of our new parallel algorithm. With reduced hash index size, it also becomes possible for us to use longer hash keys, which alleviates the hash conflicts and improves the query performance. Our experiment on an 8-socket 8-cores Intel Xeon X7550 SMP with 128 GB memory shows that the new parallel algorithm reduces LLC miss ratio to be 8%~15% of the original algorithm and the overall performance is improved by 4~11 times (6 times avg.).","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126992782","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
Detecting Data Hazards in Multi-Processor System-on-Chips on FPGA 基于FPGA的多处理器片上系统数据危害检测
Chao Wang, Xi Li, Peng Chen, Xiaojing Feng, Junneng Zhang, Xuehai Zhou
{"title":"Detecting Data Hazards in Multi-Processor System-on-Chips on FPGA","authors":"Chao Wang, Xi Li, Peng Chen, Xiaojing Feng, Junneng Zhang, Xuehai Zhou","doi":"10.1109/IPDPSW.2012.33","DOIUrl":"https://doi.org/10.1109/IPDPSW.2012.33","url":null,"abstract":"This paper presents a novel data hazards detecting engine, task score boarding, which applies instruction level score boarding algorithm to reconfigurable MPSoC on FPGA for out-of-order task execution. Task score boarding can detect inter-task data dependencies and then assign tasks to different processors or IP cores automatically. When the computing resources are sufficient and no data dependences, task score boarding allows tasks to execute out of order. We implemented the prototype system on a state-of-the-art Virtex5 FPGA board. Experimental results on sample applications demonstrated that the task score boarding can achieve more than 97% of theoretical speedup, which shows it can largely uncover task level parallelism.","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"6 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121268114","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学术官方微信