2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献

筛选
英文 中文
Conflict-Free Code Block Scheduling to Hide SpMT Inter-Core Register Sync Delay 无冲突代码块调度隐藏SpMT核间寄存器同步延迟
John M. Ye, Jason Chen, Tianzhou Chen, Qingsong Shi
{"title":"Conflict-Free Code Block Scheduling to Hide SpMT Inter-Core Register Sync Delay","authors":"John M. Ye, Jason Chen, Tianzhou Chen, Qingsong Shi","doi":"10.1109/PDCAT.2014.14","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.14","url":null,"abstract":"Speculative Multi-Threading (SpMT) is a promising technology to harness the growing number of cores in modern CPUs by exploiting the available parallelism out of sequential threads. And with SpMT, the inter-dependent fine-grain threads on different cores need to sync their input and output registers. Inter-core register sync is quite expensive, and heavily impacts the overall performance. We propose a conflict-free scheduling to avoid register read/write conflicts among concurrently executing code blocks. Therefore, while executing, the fine-grain threads do not need to sync the input or output registers with each other. Their output registers are still synced across the cores, but only consumed later. Consequently, the register sync and the execution are decoupled, and the inter-core waiting are eliminated or hidden. However, sometimes the conflict-free scheduling does not perform well when there are insufficient conflict-free code blocks to feed all the available cores. We found that, this problem with conflict-free scheduling could be partially fixed by complementing it with the naive scheduling. Experiments with SPEC2006 showed that in most cases (24 out of 29) the improved scheduling (Hybrid scheduling), i.e. The combination of the conflict-free scheduling and the naive scheduling, significantly out performed the naive scheduling.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116183817","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
New Replication Strategy Based on Maximal Frequent Correlated Pattern Mining for Data Grids 基于最大频繁关联模式挖掘的数据网格复制策略
S. Slimani, T. Hamrouni, Faouzi Ben Charrada
{"title":"New Replication Strategy Based on Maximal Frequent Correlated Pattern Mining for Data Grids","authors":"S. Slimani, T. Hamrouni, Faouzi Ben Charrada","doi":"10.1109/PDCAT.2014.31","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.31","url":null,"abstract":"Data replication in data grids is an efficient technique that aims to improve response time, reduce the bandwidth consumption and maintain reliability. In this context, a lot of work is done and many strategies have been proposed. Unfortunately, most of existing replication techniques are based on single file granularity and neglect correlation among different data files. Indeed, file correlations become an increasingly important consideration for performance enhancement in data grids. In fact, the analysis of real data intensive grid applications reveals that job requests for groups of correlated files and suggests that these correlations can be exploited for improving the effectiveness of replication strategies. In this paper, we propose a new dynamic periodic decentralized data replication strategy, called RSBMFCP (1), which consider a set of correlated files as granularity. Our strategy gathers files according to a relationship of simultaneous accesses between files by jobs and stores correlated files at the same site. In order to find out these correlations, a maximal frequent correlated pattern mining algorithm of the data mining field is introduced. We choose the all-confidence as correlation measure. The proposed strategy consists of four steps: storing file access history, converting the file access history into a logical history file, applying maximal frequent correlated pattern mining algorithm and performing replication and replacement. Experiments using the well-known data grid simulator Opt or Sim show that our proposed strategy has better performance in comparison with other strategies in terms of job execution time and effective network usage.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123231422","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
Online Scheduling of Applications on 3D Stacked Large Chip Multiprocessor 3D堆叠大芯片多处理器应用在线调度研究
B. Kumar, A. Sahu
{"title":"Online Scheduling of Applications on 3D Stacked Large Chip Multiprocessor","authors":"B. Kumar, A. Sahu","doi":"10.1109/PDCAT.2014.34","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.34","url":null,"abstract":"Performance of 3D stacked memory is impressive in multicore system. In three dimensional stacked large chip multiprocessor (3D LCMP), memory and memory network are integrated on top of the processors and processor network. In this paper, we have proposed an online strategy for mapping application's tasks and data onto 3D LCMP platforms. To meet performance constraints every application demand a set of resources (may be number of processor and amount of memory). An important criteria in allocation is to allocate all required resources as near as possible to reduce the communication overhead. We have proposed approximate nearest approach to allocate resources of a layer with respect to other resource layer (either processor or memory). In our work, we have compared three different strategies to allocate resources to application: in first one processor allocation is preferred over memory allocation, in second one memory allocation is preferred over processor and in third one priority is set depend on requirement of applications. Our experimental analysis shows 21% in average and up to 30% improvement over state of art one layer resource allocation. On demand priority based resource allocation improve 26% over simple processor or memory priority based resource allocation.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127739937","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
A Segmentation Pattern Based Approach to Automated Protocol Identification 一种基于分割模式的协议自动识别方法
Yafei Sang, Yongzheng Zhang, Yipeng Wang, Yu Zhou, Xu Tao
{"title":"A Segmentation Pattern Based Approach to Automated Protocol Identification","authors":"Yafei Sang, Yongzheng Zhang, Yipeng Wang, Yu Zhou, Xu Tao","doi":"10.1109/PDCAT.2014.10","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.10","url":null,"abstract":"In-depth understanding of network traffic is important for a variety of applications, such as network management and network security. In this paper, we propose a novel protocol identification system PSKS, which relies on the statistical signatures of network packet payloads. The proposed approach is based on the key insight that message segmentation patterns can be leveraged for accurate application identification. Specifically, the segmentation possibility for every position of protocol messages exhibits highly skewed frequency distribution due to the reason that different protocols have different message formats (i.e., Distinct message segmentation patterns). Motivated by this observation, we want to extract statistical application fingerprints by exploiting the message segmentation patterns. In PSKS, we first extract the message segmentation patterns by scoring the segmentation possibility scale for each position of messages, and then extract statistical signatures by Kolmogorov-Smirnov test and feed the signatures to tri-training, a collaborative learning algorithm. The tri-training can improve the generalization ability of our final classifier. We implemented and evaluated PSKS, and the experimental results show that PSKS achieves an average precision and recall of approximately 98%.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130921546","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}
引用次数: 4
Running Data-Intensive Scientific Workflows in the Cloud 在云中运行数据密集型科学工作流
Chiaki Sato, Luke M. Leslie, Young Choon Lee, Albert Y. Zomaya, R. Ranjan
{"title":"Running Data-Intensive Scientific Workflows in the Cloud","authors":"Chiaki Sato, Luke M. Leslie, Young Choon Lee, Albert Y. Zomaya, R. Ranjan","doi":"10.1109/PDCAT.2014.30","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.30","url":null,"abstract":"The scale of scientific applications becomes increasingly large not only in computation, but also in data. Many of these applications also concern inter-related tasks with data dependencies, hence, they are scientific workflows. The efficient coordination of executing/running scientific workflows is of great practical importance. The core of such coordination is scheduling and resource allocation. In this paper, we present three scheduling heuristics for running large-scale, data-intensive scientific workflows in clouds. In particular, the three heuristic algorithms are designed to leverage slot queue threshold, data locality and data prefetching, respectively. We also demonstrate how these heuristics can be collectively used to tackle different issues in running \"data-intensive\" workflows in clouds although each of these heuristics can be used independently. The practicality of our algorithms has been realized by actually implementing and incorporating them into our workflow execution system (DEWE). Using Montage, an astronomical image mosaic engine, as an example workflow, and Amazon EC2 as the cloud environment, we evaluate the performance of our heuristics in terms primarily of completion time (make span). We also scrutinize workflow execution showing different execution phases to identify their impact on performance. Our algorithms scale well and reduce make span by up to 27%.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127210081","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
Dealing with Skewed Data in Structured Overlays Using Variable Hash Functions 使用可变哈希函数处理结构化覆盖中的倾斜数据
M. Antoine, F. Huet
{"title":"Dealing with Skewed Data in Structured Overlays Using Variable Hash Functions","authors":"M. Antoine, F. Huet","doi":"10.1109/PDCAT.2014.15","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.15","url":null,"abstract":"Storing highly skewed data in a distributed system has become a very frequent issue, in particular with the emergence of semantic Web and Big Data. This often leads to biased data dissemination among nodes. Addressing load imbalance is necessary, especially to minimize response time and avoid workload being handled by only one or few nodes. Our contribution aims at dynamically managing load imbalance by allowing multiple hash functions on different peers, while maintaining consistency of the overlay. Our experiments, on highly skewed data sets from the semantic web, show we can distribute data on at least 300 times more peers than when not using any load balancing strategy.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126889004","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
Forced Replicable Execution for a Subset of Piecewise Deterministic Applications with Deterministic Message Passing 具有确定性消息传递的分段确定性应用程序子集的强制可复制执行
Arkadiusz Danilecki
{"title":"Forced Replicable Execution for a Subset of Piecewise Deterministic Applications with Deterministic Message Passing","authors":"Arkadiusz Danilecki","doi":"10.1109/PDCAT.2014.37","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.37","url":null,"abstract":"Ensuring replicable execution of distributed computation has many possible applications in areas of fault-tolerance, debugging, and state-machine based replication. We design a message-passing algorithm which forces a deterministic behavior for a subset of piecewise-deterministic applications. The main principle of the algorithm is to affix each message with a predetermined tag, prescribing a total order for messages.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121387571","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
Using rCUDA to Reduce GPU Resource-Assignment Fragmentation Caused by Job Scheduler 使用rCUDA减少作业调度器造成的GPU资源分配碎片
Pak Markthub, Akihiro Nomura, S. Matsuoka
{"title":"Using rCUDA to Reduce GPU Resource-Assignment Fragmentation Caused by Job Scheduler","authors":"Pak Markthub, Akihiro Nomura, S. Matsuoka","doi":"10.1109/PDCAT.2014.26","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.26","url":null,"abstract":"In heterogeneous supercomputers such as TSUBAME2.5, GPUs on some nodes in GPU batch queues are left idle even though there are jobs waiting in the queues, this is caused by GPU resource-assignment fragmentation problem. For example, in the case that each node has three GPUs like TSUBAME2.5's, if a node has already been assigned to a job requesting two GPUs per node, that node cannot be assigned to another job requesting more than one GPU per node until the ongoing job finishes, hence, one GPU is left idle on that node. We examine this problem on TSUBAME2.5's GPU batch-queue system and present a scheduling algorithm that assigns rCUDA (a remote CUDA execution technology) to some processes of some jobs. Because rCUDA allows jobs to utilize the idle GPUs, the proposed scheduling algorithm can alleviate the problem. Using a job pattern obtained from a scheduler log of a TSUBAME2.5's GPU queue, our simulation shows that the proposed algorithm can decrease jobs' lifetime (from the time when a job arrives until finishes) by about 5% on average. Moreover, it can reduce the average number of idle GPUs by about 15%. Also, even reducing the number of nodes serving jobs by around 4%, the proposed algorithm can maintain the average jobs' lifetime around the same as the scheduling algorithm currently used in the TSUBAME2.5's GPU queue.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123334544","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
Sparse Matrix-Vector Multiplication: A Data Mapping-Based Architecture 稀疏矩阵-向量乘法:基于数据映射的体系结构
Ahmad Mansour, J. Götze, W. Hsu, S. Ruan
{"title":"Sparse Matrix-Vector Multiplication: A Data Mapping-Based Architecture","authors":"Ahmad Mansour, J. Götze, W. Hsu, S. Ruan","doi":"10.1109/PDCAT.2014.32","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.32","url":null,"abstract":"The performance of the sparse matrix-vector multiplication (SMVM) on a parallel system is strongly affected by the distribution of data among its components. Two costs arise as a result of the used data mapping method: arithmetic and communication. The communication cost often dominates the arithmetic cost, and the gap between these costs tends to increase. Therefore, finding a mapping method that reduces the communication cost is of high importance. On the other hand, the load distribution among the processing units must not be sacrificed. In this paper, a data mapping method is proposed for SMVM on Network-on-Chip which achieves balanced working load and reduces the communication cost. Afterwards, an FPGA-based architecture is introduced which is designed to fit with the proposed data mapping method.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123681172","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 the Shallow-Light Steiner Tree Problem 浅光斯坦纳树问题
Longkun Guo, Kewen Liao, Hong Shen
{"title":"On the Shallow-Light Steiner Tree Problem","authors":"Longkun Guo, Kewen Liao, Hong Shen","doi":"10.1109/PDCAT.2014.17","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.17","url":null,"abstract":"Let G = (V, E) be a given graph with nonnegative integral edge cost and delay, S ⊆ V be a terminal set and r ∈ S be the selected root. The shallow-light Steiner tree (SLST) problem is to compute a minimum cost tree spanning the terminals of S, such that the delay between r and every other terminal is bounded by a given delay constraint D ∈ ℤ<sub>0</sub><sup>+</sup>. It is known that the SLST problem is NP-hard and unless NP ⊆ DTIME(n<sup>log log n</sup>) there exists no approximation algorithm with ratio (1, γ log2 n) for some fixed γ > 0 [12]. Nevertheless, under the same assumption it admits no approximation ratio better than (1, γ log<sup>2</sup> n) for some fixed γ > 0 even when D = 2 [2]. This paper first gives an exact algorithm with time complexity O(3<sup>t</sup>nD + 2<sup>t</sup>n<sup>2</sup>D<sup>2</sup> + n<sup>3</sup>D<sup>3</sup>), where n and t are the numbers of vertices and terminals of the given graph respectively. This is a pseudo polynomial time parameterized algorithm with respect to the parameterization “number of terminals”. Later, this algorithm is improved to a parameterized approximation algorithm with a time complexity O(3<sup>t</sup> n<sup>2</sup>/∈ + 2<sup>t</sup> n<sup>4</sup>/∈<sup>2</sup> + n<sup>6</sup>/∈<sup>3</sup> ) and a bifactor approximation ratio (1 + ∈, 1). That is, for any small real number ∈ > 0, the algorithm computes a Steiner tree with delay and cost bounded by (1 + ∈)D and the optimum cost respectively.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117194245","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
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学术官方微信
小红书