2012 11th International Symposium on Parallel and Distributed Computing最新文献_第3页

Data Mule Service for Mobile Ad-Hoc Networks 移动Ad-Hoc网络的数据骡子服务

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.38

Mark Riordan, D. Grigoras

引用次数: 4

4-4, 1-4: Architecture for Data Center Network Based on IP Address Hierarchy for Efficient Routing 4- 4,1 -4:基于IP地址层次的高效路由数据中心网络体系结构

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.39

A. Kumar, S. Rao, D. Goswami

{"title":"4-4, 1-4: Architecture for Data Center Network Based on IP Address Hierarchy for Efficient Routing","authors":"A. Kumar, S. Rao, D. Goswami","doi":"10.1109/ISPDC.2012.39","DOIUrl":"https://doi.org/10.1109/ISPDC.2012.39","url":null,"abstract":"Architecture plays an important role in the design of Data Center Networks (DCN). Designs for DCN are to be scalable, robust and efficient. There are many designs proposed in recent years where routing is performed using location information of the server. These designs solve scalability problem of IP and Ethernet with additional overhead of determining and maintaining location information of the server. In this paper, we propose a new architecture named, four-four, one-four architecture (4-4, 1-4 Architecture) that has evolved from the format of IP address. Addressing and interconnection used in our design eliminate the complexities in the previous designs such as constructing addresses based on location information. Two major benefits - reduction of entries in routing table and routing based on location information - are achieved through our design with minimum complexity. The first advantage is due to the design combining servers with common prefixes at each level using hierarchical format of IP address. The second advantage is due to the IP address assigned to servers and switches acting as location indicator. This helps in faster routing where packet forwarding is done based on the bits of IP addresses. Further, the proposed architecture meets major design requirements for data center networks such as load balancing and energy conservation.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120960912","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

Performance of a Structure-Detecting SpMV Using the CSR Matrix Representation 基于CSR矩阵表示的结构检测SpMV性能研究

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.9

Hans Pabst, Beverly Bachmayer, Michael Klemm

引用次数: 1

A Distributed Methodology for Imbalanced Classification Problems 不平衡分类问题的分布式方法

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.30

C. Lemnaru, M. Cuibus, Adrian Bona, Andy S. Alic, R. Potolea

{"title":"A Distributed Methodology for Imbalanced Classification Problems","authors":"C. Lemnaru, M. Cuibus, Adrian Bona, Andy S. Alic, R. Potolea","doi":"10.1109/ISPDC.2012.30","DOIUrl":"https://doi.org/10.1109/ISPDC.2012.30","url":null,"abstract":"Current important challenges in data mining research are triggered by the need to address various particularities of real-world problems, such as imbalanced data and error cost distributions. This paper presents Distributed Evolutionary Cost-Sensitive Balancing, a distributed methodology for dealing with imbalanced data and -- if necessary -- cost distributions. The method employs a genetic algorithm to search for an optimal cost matrix and base classifier settings, which are then employed by a cost-sensitive classifier, wrapped around the base classifier. Individual fitness computation is the most intensive task in the algorithm, but it also presents a high parallelization potential. Two different parallelization alternatives have been explored: a computation-driven approach, and a data-driven approach. Both have been developed within the Apache Watchmaker framework and deployed on Hadoop-based infrastructures. Experimental evaluations performed up to this point have indicated that the computation-driven approach achieves a good classification performance, but does not reduce the running time significantly, the data-driven approach reduces the running time for slow algorithms, such as the kNN and the SVM, while still yielding important performance improvements.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121339901","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}

引用次数: 9

Web Services Allocation Guided by Reputation in Distributed SOA-Based Environments 分布式soa环境中基于声誉的Web服务分配

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.25

V. Serbanescu, Florin Pop, V. Cristea, O. Achim

{"title":"Web Services Allocation Guided by Reputation in Distributed SOA-Based Environments","authors":"V. Serbanescu, Florin Pop, V. Cristea, O. Achim","doi":"10.1109/ISPDC.2012.25","DOIUrl":"https://doi.org/10.1109/ISPDC.2012.25","url":null,"abstract":"Web services have become one of the easiest ways to fulfill a wide range of tasks in multiple domains of work. Their availability has increased significantly through Service-Oriented Distributed Environments that have become standard platforms for their deployment. At the same time, the clients impose their own constraints and expectations from services and require from the service providers the best replica to satisfy these constraints. The main objective of this paper is implementing a model that can effectively and accurately determine the best endpoint of a web service deployed in a distributed environment depending on the constraints of the client that invoked it and the capabilities of each replica. While each service offers different functions and each client may have different preferences for these functions, our method is independent from the services' features and computes the best replica using properties that define quality (processing time), business constraints (service price) and client's feedback (reputation), properties available for every service. The model is purely mathematical and will produce the same results for the same values of these criteria regardless of the particular functionality of the service invoked. The algorithm behind the model also takes into account the properties specific to distributed environments such as the client's location or the load limitations of the system on which the replica is deployed. This paper describes this algorithm, along with its architecture of the system that implements the model and the tests conducted.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117208063","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}

引用次数: 14

Steps towards GPU Accelerated Aggregation AMG GPU加速聚合AMG的步骤

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.19

M. Emans, M. Liebmann, B. Basara

引用次数: 7

Determining the Availability of Grid Resources Using Active Probing 使用主动探测确定网格资源的可用性

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.21

Christian Straube, Michael Schiffers, D. Kranzlmüller

引用次数: 1

A Framework for Parallel Numerical Simulations on Multi-Scale Geometries 多尺度几何并行数值模拟框架

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.44

V. Varduhn, R. Mundani, E. Rank

引用次数: 3

Scalable and Resilient Workflow Executions on Production Distributed Computing Infrastructures 生产分布式计算基础设施上的可伸缩和弹性工作流执行

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.24

J. R. Balderrama, Tram Truong Huu, J. Montagnat

{"title":"Scalable and Resilient Workflow Executions on Production Distributed Computing Infrastructures","authors":"J. R. Balderrama, Tram Truong Huu, J. Montagnat","doi":"10.1109/ISPDC.2012.24","DOIUrl":"https://doi.org/10.1109/ISPDC.2012.24","url":null,"abstract":"In spite of the growing interest for grids and cloud infrastructures among scientific communities and the availability of such facilities at large-scale, achieving high performance in production environments remains challenging due to at least four factors: the low reliability of very large-scale distributed computing infrastructures, the performance overhead induced by shared facilities, the difficulty to obtain fair balance of all user jobs in such an heterogeneous environment, and the complexity of large-scale distributed applications deployment. All together, these difficulties make infrastructure exploitation complex, and often limited to experts. This paper introduces a pragmatic solution to tackle these four issues based on a service-oriented methodology, the reuse of existing middleware services, and the joint exploitation of local and distributed computing resources. Emphasis is put on the integrated environment ease of use. Results on an actual neuroscience application show the impact of the environment setup in terms of reliability and performance. Recommendations and best practices are derived from this experiment.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130001521","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

A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols 安全协议上LTL公式动态校验的BSP算法

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.10

F. Gava, Michaël Guedj, F. Pommereau

引用次数: 2