2008 International Symposium on Parallel and Distributed Computing最新文献

Performance Analysis of Grid DAG Scheduling Algorithms using MONARC Simulation Tool 基于MONARC仿真工具的网格DAG调度算法性能分析

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.15

Florin Pop, C. Dobre, V. Cristea

{"title":"Performance Analysis of Grid DAG Scheduling Algorithms using MONARC Simulation Tool","authors":"Florin Pop, C. Dobre, V. Cristea","doi":"10.1109/ISPDC.2008.15","DOIUrl":"https://doi.org/10.1109/ISPDC.2008.15","url":null,"abstract":"This paper presents a solution to analyze the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Grid systems is important due to the latest computing necessities: large scale distributed computing and complex applications for different research areas. We propose a solution to evaluate DAG scheduling algorithms using simulation, an approach suitable to evaluate different scheduling algorithms using various task dependencies and considering a wide range of Grid system architectures. Our proposed solution is based on MONARC, a generic simulation framework designed for modeling large scale distributed systems. We present our research results in extending the simulation platform to accommodate various DAG scheduling procedures and, as a case study, we present a critical analysis of four well known DAG scheduling strategies: CCF (Cluster ready Children First), ETF (Earliest Time First), HLFET (Highest Level First with Estimated Times) and Hybrid Remapper. The obtained results show that the proposed solution is a very good instrument for evaluating performance in case of a wide range of DAG scheduling algorithms.","PeriodicalId":125975,"journal":{"name":"2008 International Symposium on Parallel and Distributed Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130238315","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}

引用次数: 31

Parallel Metropolis-Montecarlo Simulation for Potts Model using an Adaptable Network Topology based on Dynamic Graph Partitioning 基于动态图划分的自适应网络拓扑对Potts模型的并行Metropolis-Montecarlo仿真

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.51

Carlos Castañeda Marroquín, C. Navarrete, A. Ortega, M. Alfonseca, E. Anguiano

引用次数: 5

Software probes: towards a quick method for machine characterization and application performance prediction 软件探测:一种用于机器表征和应用性能预测的快速方法

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.40

A. Strube, Dolores Rexachs, E. Luque

{"title":"Software probes: towards a quick method for machine characterization and application performance prediction","authors":"A. Strube, Dolores Rexachs, E. Luque","doi":"10.1109/ISPDC.2008.40","DOIUrl":"https://doi.org/10.1109/ISPDC.2008.40","url":null,"abstract":"Computers perform different applications in different ways. To characterize an application performance into a machine, the usual method is a throughout execution of it. This work is a step into a synthetic probe able to characterize a master-worker application's performance in a fraction of the time required to run it entirely. This is specially important for CPU-intensive scientific applications, who runs for very long, as it makes sense that it runs as efficiently (and fast) as possible. To know how, and for how long a master-worker application is going to run can guide the decision to use this machine or not. Our software probe takes into account only the performance-relevant parts of the application, discovering a program's relevant phases. Running solely these significant phases is a powerful way to quickly characterize the application's performance on a machine. It can help to select the best computing nodes in a grid or in a multi-cluster to run this application, and even quickly predict the total execution time for this application/data set in the machine analyzed. We also present ongoing work on a fully synthetic probe generated from programs' phases.","PeriodicalId":125975,"journal":{"name":"2008 International Symposium on Parallel and Distributed Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128929439","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

A Runtime System Architecture for Ubiquitous Support of OpenMP 一个支持OpenMP的运行时系统架构

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.49

G. C. Philos, V. Dimakopoulos, P. Hadjidoukas

引用次数: 4

Modeling and Formal Validation of High-Performance Embedded Systems 高性能嵌入式系统的建模与形式化验证

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.28

A. Gamatie, É. Rutten, Huafeng Yu, Pierre Boulet, J. Dekeyser

引用次数: 8

Heterogeneous PBLAS: Optimization of PBLAS for Heterogeneous Computational Clusters 异构PBLAS:面向异构计算集群的PBLAS优化

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.9

Ravi Reddy, Alexey L. Lastovetsky, P. Alonso

引用次数: 6

Spontaneous, Self-Sampling Quorum Systems for Ad Hoc Networks 自组织网络的自发自采样仲裁系统

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.61

K. Konwar, Peter M. Musial, Alexander A. Shvartsman

{"title":"Spontaneous, Self-Sampling Quorum Systems for Ad Hoc Networks","authors":"K. Konwar, Peter M. Musial, Alexander A. Shvartsman","doi":"10.1109/ISPDC.2008.61","DOIUrl":"https://doi.org/10.1109/ISPDC.2008.61","url":null,"abstract":"Quorum systems-collections of sets with pairwise nonempty intersections-are used in distributed settings to implement services such as consensus and consistent memory. Quorums have been substantially studied in static settings, however the design and analysis of quorum-based distributed services in resource-limited ad hoc networks is a relatively unexplored area. The pioneering work of Chockler, Gilbert, and Patt-Shamir considers such networks and proposes an implementation of probabilistic quorum systems with per-node communication bit complexity of O(log2 n), where n is the number of nodes. The authors assumes a priori knowledge of node failure probability p, where 0 ¿ p < 1/4. Additionally their work overlooks the cost of gathering responses from quorum members by the client. We present a new probabilistic quorum construction with a lower, per quorum access, communication bit complexity of O(log n) for multi-hop networks. Our quorum access algorithm is based on self-sampling by the nodes themselves, in a way equivalent to accessing a quorum set, with high probability. In addition, we provide a novel on-line algorithm to estimate the node failure probability parameter p, thus removing the assumption that it is known a priori. This is accomplished with per node communication bit complexity of O(log2 n). We demonstrate the utility of our construction by presenting a single-writer, multi-reader algorithm that uses our probabilistic quorums to implement atomic objects in ad hoc networks, where consistency is guaranteed with high probability. We include simulation results illustrating the high probability guarantee for our atomic memory service.","PeriodicalId":125975,"journal":{"name":"2008 International Symposium on Parallel and Distributed Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126145177","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

An Exhaustive Comparison Framework for Distributed Shape Differentiation in a MEMS Sensor Actuator Array MEMS传感器致动器阵列中分布式形状微分的穷举比较框架

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.55

Eugen Dedu, Kahina Boutoustous, J. Bourgeois

引用次数: 13

Scheduled Routing in an Optical Hypercube 光超立方体中的定时路由

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.16

Risto T. Honkanen

引用次数: 0

Randomized Online File Allocation on Uniform Ring Networks 统一环网中的随机在线文件分配

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.27

Akira Matsubayashi, Y. Kawamura

引用次数: 0