2017 46th International Conference on Parallel Processing Workshops (ICPPW)最新文献

筛选
英文 中文
Towards a Scalable and Adaptable Resource Allocation Framework in Cloud Environments 面向云环境中可扩展和可适应的资源分配框架
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.31
Huanhuan Xiong, Christos Filelis‐Papadopoulos, Dapeng Dong, Gabriel G. Castañé, J. Morrison
{"title":"Towards a Scalable and Adaptable Resource Allocation Framework in Cloud Environments","authors":"Huanhuan Xiong, Christos Filelis‐Papadopoulos, Dapeng Dong, Gabriel G. Castañé, J. Morrison","doi":"10.1109/ICPPW.2017.31","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.31","url":null,"abstract":"Finding an appropriate resource to host the next application to be deployed in a Cloud environment can be a non-trivial task. To deliver the appropriate level of service, the functional requirements of the application must be met. Ideally, this process involves filtering the best resource from a number of possible candidates, whilst simultaneously satisfying multiple objectives. If timely responses to resource requests are to be maintained, the sophistication of the filtering mechanism and the size of the search space have to be carefully balanced. The quality of the solution will thus not readily scale with growth in cloud resources and filtering complexity. This limitation is becoming more evident with the emergence of hyper-scale clouds and with the increased complexity needed to accommodate the growing heterogeneity in resources. Moreover, meeting non-functional requirements, reflecting the Cloud Service Provider's business objects, is also becoming increasingly critical as service utilization and energy efficiency in a typical cloud deployment are extremely low. This paper proposes a reexamination of the resource allocation problem by proposing a framework to support distributed resource allocation decisions and that can be dynamically populated with strategies to reflect the ever-growing number of diverse objectives as they become evident in the evolving cloud infrastructure.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129721735","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
Anticipation Preference-Based Heuristic Scheduling in Grid Virtual Organizations 网格虚拟组织中基于预期偏好的启发式调度
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.47
V. Toporkov, D. Yemelyanov, A. Toporkova
{"title":"Anticipation Preference-Based Heuristic Scheduling in Grid Virtual Organizations","authors":"V. Toporkov, D. Yemelyanov, A. Toporkova","doi":"10.1109/ICPPW.2017.47","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.47","url":null,"abstract":"In this work, a job-flow scheduling approach for Grid virtual organizations (VOs) is proposed and studied. Users' and resource providers' preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. With increasing resources utilization level the available resources set and corresponding decision space are reduced. This further complicates the problem of efficient scheduling. In order to improve overall scheduling efficiency, we propose an anticipation scheduling approach based on a cyclic scheduling scheme. It generates a near optimal but infeasible scheduling solution and includes a special replication procedure for efficient and feasible resources allocation. Anticipation scheduling is compared with the general cycle scheduling scheme and conservative backfilling using such criteria as average jobs' start and finish times as well as users' and VO economic criteria (execution time and cost).","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129078690","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
EDDS: An Enhanced Density-Based Method for Clustering Data Streams EDDS:一种增强的基于密度的数据流聚类方法
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.27
Ammar Al Abd Alazeez, S. Jassim, H. Du
{"title":"EDDS: An Enhanced Density-Based Method for Clustering Data Streams","authors":"Ammar Al Abd Alazeez, S. Jassim, H. Du","doi":"10.1109/ICPPW.2017.27","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.27","url":null,"abstract":"Data stream clustering is an active area of research in big data. It refers to clustering constantly arriving new data records and updating existing cluster patterns and outliers in light of the newly arriving data. Density-based algorithms for solving this problem have the promise for finding arbitrary shape clusters and detecting anomalies without prior knowledge of the number of clusters. In this paper, a new incremental algorithm known as Enhanced Density-based Data Stream (EDDS) is developed to overcome limitations with the existing solutions. The algorithm detects clusters and outliers in an incoming data chunk, merges new clusters from the chunk with the existing clusters, and filters out new outliers for the next round. It modified the traditional DBSCAN algorithm to summarise each cluster in terms of a set of surface-core points. The algorithm applies the density-reachable concept of DBSCAN as its merging strategy and prunes the internal core points using a heuristic solution. The algorithm also removes the aged core points and outliers depending on a fading function. The paper investigates three versions of the algorithm for three possible representations of clusters where either all core points are maintained (EDDS-I), only core points of the new clusters from the incoming chunk are kept (EDDS-II), or only the surface-core points of the cluster shapes are kept (EDDS-III) to examine the balance between the efficiency gain for the algorithm and the amount of overhead time committed for pruning internal core points. The algorithm was evaluated on selected datasets using various quality measures. The experimental results indicate improvements in terms of clustering correctness with a comparable time complexity over the existing solutions for solving the same kind of problems.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123936361","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
Parallel Desolvation Energy Term Calculation for Blind Docking on GPU Architectures GPU架构盲对接的并行消能项计算
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.16
Hocine Saadi, Nadia Nouali-Taboudjemat, Abdellatif Rahmoun, Baldomero Imbernón, H. Sánchez, J. Cecilia
{"title":"Parallel Desolvation Energy Term Calculation for Blind Docking on GPU Architectures","authors":"Hocine Saadi, Nadia Nouali-Taboudjemat, Abdellatif Rahmoun, Baldomero Imbernón, H. Sánchez, J. Cecilia","doi":"10.1109/ICPPW.2017.16","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.16","url":null,"abstract":"In the recent literature, drug design relying on molecular docking (MD) techniques is becoming a very promising field. Most of these techniques rely on the way ligands interact with protein target using only one binding site, in addition, they ignore the fact that assorted ligands interact with unconnected parts of the target. However, by taking the latter fact into consideration, the computational complexity grows exponentially, and the energy calculation to evaluate poses on each binding site becomes more intensive. These two challenges are massively parallel in nature, thus they are very suitable for the field of high performance computing (HPC). This paper proposes the design and tuning procedures of energy desolvation term for blind docking based on the NVIDIA GPU architecture. Experiments on a hundred binding sites when docking six protein-ligand complexes of different sizes, shows that our methodology achieves a good performance. Indeed, the parallel implementation gains average speedup of 225x with respect to single core, and 62x with respect to four CPU cores. This encourages the design of parallelizing processes when dealing with molecular docking techniques.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126566911","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
Implementation of an Efficient Blind Docking Technique on HPC Architectures for the Discovery of Allosteric Inhibitors 一种高效的HPC结构盲对接技术在变构抑制剂发现中的实现
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.18
H. Sánchez, J. P. Cerón-Carrasco, J. Cecilia
{"title":"Implementation of an Efficient Blind Docking Technique on HPC Architectures for the Discovery of Allosteric Inhibitors","authors":"H. Sánchez, J. P. Cerón-Carrasco, J. Cecilia","doi":"10.1109/ICPPW.2017.18","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.18","url":null,"abstract":"The problem of the discovery and marketing of new drugs can be vastly accelerated through High Performance Computing (HPC), molecular modeling techniques, and more specifically by means of the techniques commonly named as computational drug discovery (CDD) and in silico high throughput screening. These techniques usually assume a unique interaction site (active site) between potential drugs and a chosen protein target. This can lead to drastic limitations regarding the number and types of novel drugs that can be discovered since allosteric sites and other interaction spots different from active site are not explored. In order to solve this problem in this paper we introduce a technique based on advanced CDD technologies that exploit HPC architectures and called Blind Docking (BD). We also report our business prototyping efforts following Lean Startup principles in order to bring BD technology into the market.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130934804","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
Thermal-Aware Job Scheduling of MapReduce Applications on High Performance Clusters 高性能集群上MapReduce应用的热感知作业调度
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.46
Shubbhi Taneja, Yi Zhou, Mohammed Alghamdi, X. Qin
{"title":"Thermal-Aware Job Scheduling of MapReduce Applications on High Performance Clusters","authors":"Shubbhi Taneja, Yi Zhou, Mohammed Alghamdi, X. Qin","doi":"10.1109/ICPPW.2017.46","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.46","url":null,"abstract":"In this study, we develop a thermal-aware job scheduling strategy called tDispatch tailored for MapReduce applications running on Hadoop clusters. The scheduling idea of tDispatch is motivated by a profiling study of CPU-intensive and I/O-intensive jobs from the perspective of thermal efficiency. More specifically, we investigate the thermal behaviors of these two types of jobs running on a Hadoop cluster by stress testing data nodes through extensive experiments. We show that CPU-intensive and I/O-intensive jobs exhibit various thermal and performance impacts on multicore processors and hard drives of Hadoop cluster nodes. After we quantify the thermal behaviors of Hadoop jobs on the master and data nodes of a cluster, we propose our scheduler to alternatively dispatch CPU-intensive and I/O-intensive jobs. We apply our strategy to several MapReduce applications with different resource consumption profiles. Our experimental results show that tDispatch is conducive of creating opportunities to cool down multicore processors and disks in Hadoop clusters deployed in modern data centers. Our findings can be applied in other thermal-efficient job schedulers that are aware of thermal behaviors of CPU-intensive and I/O-intensive applications submitted to Hadoop clusters.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132178240","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
Trajectory Data Cleansing Using HMM 使用HMM的轨迹数据清理
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-06-28 DOI: 10.1109/ICPPW.2017.15
Qin Wang, Min-Te Sun, Kazuya Sakai
{"title":"Trajectory Data Cleansing Using HMM","authors":"Qin Wang, Min-Te Sun, Kazuya Sakai","doi":"10.1109/ICPPW.2017.15","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.15","url":null,"abstract":"The vehicle trajectory dataset is often contaminated by GPS errors and low sampling rate. Consequently, it is important to cleanse the trajectory dataset before it can be used for any research or application. In this paper, we propose a HMM based system to cleanse and rebuild the missing traveling routes of vehicles in a given trajectory dataset. Considering the candidates of each entry as variables, a set of formulae for the transition probability and observation probability are proposed. The experiments using the OpenStreetMap of Beijing and the taxi trajectory dataset collected by Microsoft Research Lab, Asia confirm that our proposed system significantly improves the quality of the dataset.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"28 2-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116564109","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
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学术官方微信
小红书