2010 39th International Conference on Parallel Processing最新文献_第5页

Optimal Task Reallocation in Heterogeneous Distributed Computing Systems with Age-Dependent Delay Statistics 具有年龄相关延迟统计的异构分布式计算系统的最优任务再分配

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.20

J. Pezoa, M. Hayat, Zhuoyao Wang, S. Dhakal

{"title":"Optimal Task Reallocation in Heterogeneous Distributed Computing Systems with Age-Dependent Delay Statistics","authors":"J. Pezoa, M. Hayat, Zhuoyao Wang, S. Dhakal","doi":"10.1109/ICPP.2010.20","DOIUrl":"https://doi.org/10.1109/ICPP.2010.20","url":null,"abstract":"This paper presents a general framework for optimal task reallocation in heterogeneous distributed-computing systems and offers a rigorous analytical model for the stochastic execution time of a workload. The model takes into account the heterogeneity and stochastic nature of the tasks' service and transfer times, servers' failure times, as well as an arbitrary task-reallocation policy. The stochastic service, transfer and failure times are assumed to have general, age-dependent (non-exponential) distributions, resulting in a tandem distributed queuing system with non-Markovian dynamics. Auxiliary age variables are introduced in the analysis to capture the memory associated with the non-Markovian stochastic times, thereby enabling a regenerative age-dependent analytical characterization of the statistics of the execution time of a workload. The model is utilized to devise task reallocation policies that optimize three metrics: the average execution time of a workload, the quality-of-service in executing a workload by a prescribed deadline and the reliability in executing a workload. Implications of the non-exponential event times on these metrics are also studied. Key results are verified experimentally on a distributed-computing testbed.","PeriodicalId":180554,"journal":{"name":"2010 39th International Conference on Parallel Processing","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126183298","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

Detailed Load Balance Analysis of Large Scale Parallel Applications 大规模并行应用的详细负载平衡分析

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.61

K. Huck, J. Labarta

引用次数: 12

A MapReduce Style Framework for Computations on Trees 树上计算的MapReduce风格框架

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.42

William Sarje, S. Aluru

引用次数: 8

Automatic Generation of Stream Descriptors for Streaming Architectures 流架构中流描述符的自动生成

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.38

L. Gao, David Zaretsky, Gaurav Mittal, D. Schonfeld, P. Banerjee

引用次数: 1

Incentive Compatible Online Scheduling of Malleable Parallel Jobs with Individual Deadlines 具有个人截止日期的可塑并行作业的激励兼容在线调度

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.60

T. E. Carroll, Daniel Grosu

{"title":"Incentive Compatible Online Scheduling of Malleable Parallel Jobs with Individual Deadlines","authors":"T. E. Carroll, Daniel Grosu","doi":"10.1109/ICPP.2010.60","DOIUrl":"https://doi.org/10.1109/ICPP.2010.60","url":null,"abstract":"We consider the online scheduling of malleable jobs on parallel systems, such as clusters, symmetric multiprocessing computers, and multi-core processor computers. Malleable jobs is a model of parallel processing in which jobs adapt to the number of processors assigned to them. This model permits the scheduler and resource manager to make more efficient use of the available resources. Each malleable job is characterized by arrival time, deadline, and value. If the job completes by its deadline, the user earns the payoff indicated by the value; otherwise, she earns a payoff of zero. The scheduling objective is to maximize the sum of the values of the jobs that complete by their associated deadlines. Complicating the matter is that users in the real world are rational and they will attempt to manipulate the scheduler by misreporting their jobs' parameters if it benefits them to do so. To mitigate this behavior, we design an incentive compatible online scheduling mechanism. Incentive compatibility assures us that the users will obtain the maximum payoff only if they truthfully report their jobs' parameters to the scheduler. Finally, we simulate and study the mechanism to show the effects of misreports on the cheaters and on the system.","PeriodicalId":180554,"journal":{"name":"2010 39th International Conference on Parallel Processing","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133783239","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}

引用次数: 24

Optimizing HPC Fault-Tolerant Environment: An Analytical Approach 优化HPC容错环境:一种分析方法

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.80

Hui Jin, Yong Chen, Huaiyu Zhu, Xian-He Sun

引用次数: 45

Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming 基于并行颜色编码和流的大型社交网络子图枚举

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.67

Zhao Zhao, Maleq Khan, V. S. A. Kumar, M. Marathe

引用次数: 52

Task Assignment with Cache Partitioning and Locking for WCET Minimization on MPSoC 任务分配与缓存分区和锁定在MPSoC上的WCET最小化

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.65

Tiantian Liu, Yingchao Zhao, Minming Li, C. Xue

{"title":"Task Assignment with Cache Partitioning and Locking for WCET Minimization on MPSoC","authors":"Tiantian Liu, Yingchao Zhao, Minming Li, C. Xue","doi":"10.1109/ICPP.2010.65","DOIUrl":"https://doi.org/10.1109/ICPP.2010.65","url":null,"abstract":"Cache is known for its unpredictability in embedded systems. Cache locking technique is often utilized to guarantee a tighter prediction of Worst-Case Execution Time (WCET) which is one of the most important performance metrics for embedded systems. However, in Multi-Processor Systems-on-Chip (MPSoC) systems with multi-tasks, Level 2 (L2) cache is often shared among different tasks and cores, which leads to higher complexity in the cache management and extended unpredictability of cache. Task assignment has inherent relevancy for cache behavior, while cache behavior also affects the efficiency of task assignment. Task assignment and cache behavior have dramatic influences on the overall WCET of MPSoC. In this paper, overall WCET represents the worst-case finishing time of a set of tasks running on different cores. This paper proposes joint task assignment and cache partitioning techniques to minimize the overall WCET for MPSoC systems. Cache locking is applied to each task to guarantee a precise WCET, which in return facilitates task assignment and cache partitioning. We prove that the joint problem is NP-Hard and propose several efficient algorithms. Experimental results show that the proposed algorithms can consistently reduce the overall WCET compared to previous techniques.","PeriodicalId":180554,"journal":{"name":"2010 39th International Conference on Parallel Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117087900","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}

引用次数: 34

Checkpointing vs. Migration for Post-Petascale Supercomputers 后千兆级超级计算机的检查点与迁移

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.26

F. Cappello, H. Casanova, Y. Robert

{"title":"Checkpointing vs. Migration for Post-Petascale Supercomputers","authors":"F. Cappello, H. Casanova, Y. Robert","doi":"10.1109/ICPP.2010.26","DOIUrl":"https://doi.org/10.1109/ICPP.2010.26","url":null,"abstract":"An alternative to classical fault-tolerant approaches for large-scale clusters is failure avoidance, by which the occurrence of a fault is predicted and a preventive measure is taken. We develop analytical performance models for two types of preventive measures: preventive checkpointing and preventive migration. We also develop an analytical model of the performance of a standard periodic checkpoint fault-tolerant approach. We instantiate these models for platform scenarios representative of current and future technology trends. We find that preventive migration is the better approach in the short term by orders of magnitude. However, in the longer term, both approaches have comparable merit with a marginal advantage for preventive checkpointing. We also find that standard non-prediction-based fault tolerance achieves poor scaling when compared to prediction-based failure avoidance, thereby demonstrating the importance of failure prediction capabilities. Finally, our results show that achieving good utilization in truly large-scale machines (e.g., 2^{20} nodes) for parallel workloads will require more than the failure avoidance techniques evaluated in this work.","PeriodicalId":180554,"journal":{"name":"2010 39th International Conference on Parallel Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114866304","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}

引用次数: 23

A Quantitative Study of Accountability in Wireless Multi-hop Networks 无线多跳网络中责任的定量研究

2010 39th International Conference on Parallel Processing Pub Date : 2010-09-13 DOI: 10.1109/ICPP.2010.29

Zhifeng Xiao, Yang Xiao, Jie Wu

引用次数: 13