Int. J. Netw. Comput.最新文献_第9页

Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2015 前言:2015年并行和分布式计算模型进展研讨会特刊

Int. J. Netw. Comput. Pub Date : 2016-01-12 DOI: 10.15803/IJNC.6.1_1

A. Fujiwara, Susumu Matsumae

{"title":"Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2015","authors":"A. Fujiwara, Susumu Matsumae","doi":"10.15803/IJNC.6.1_1","DOIUrl":"https://doi.org/10.15803/IJNC.6.1_1","url":null,"abstract":"The 17th Workshop on Advances in Parallel and Distributed Computational Models (APDCM) -- held in conjunction with the International Parallel and Distributed Processing Symposium (IPDPS) on May 25-29, 2015, in Hyderabad, India, - aims to provide a timely forum for the exchange and dissemination of new ideas, techniques and research in the field of the parallel and distributed computational models. The APDCM workshop has a history of attracting participation from reputed researchers worldwide. The program committee has encouraged the authors of accepted papers to submit full-versions of their manuscripts to the International Journal of Networking and Computing (IJNC) after the workshop. After a thorough reviewing process, with extensive discussions, five articles on various topics have been selected for publication on the IJNC special issue on APDCM. On behalf of the APDCM workshop, we would like to express our appreciation for the large efforts of reviewers who reviewed papers submitted to the special issue. Likewise, we thank all the authors for submitting their excellent manuscripts to this special issue. We also express our sincere thanks to the editorial board of the International Journal of Networking and Computing, in particular, to the Editor-in-chief Professor Koji Nakano. This special issue would not have been possible without his support.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126500558","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

Topology Management for Reducing Energy Consumption and Tolerating Failures in Wireless Sensor Networks 无线传感器网络中降低能耗和容错的拓扑管理

Int. J. Netw. Comput. Pub Date : 2016-01-12 DOI: 10.15803/IJNC.6.1_107

Qian Zhao, Y. Nakamoto

{"title":"Topology Management for Reducing Energy Consumption and Tolerating Failures in Wireless Sensor Networks","authors":"Qian Zhao, Y. Nakamoto","doi":"10.15803/IJNC.6.1_107","DOIUrl":"https://doi.org/10.15803/IJNC.6.1_107","url":null,"abstract":"We investigated energy efficient and fault tolerant topologies for wireless sensor networks (WSNs), addressing the need to minimize communication distances because the energy used for communication is proportional to the 2nd to 6th power of the distance. We also investigated the energy hole phenomenon, in which non-uniform energy usage among nodes causes non-uniform lifetimes. This, in turn, increases the communication distances and results in a premature shutdown of the entire network. Because some sensor nodes in a WSN may be unreliable, it must be tolerant to faults. A routing algorithm called the â€œenergy hole aware energy efficient communication routing algorithmâ€ (EHAEC) was previously proposed. It solves the energy hole problem to the maximum extent possible while minimizing the amount of energy used for communication, by generating an energy efficient spanning tree. In this paper, we propose two provisioned fault tolerance algorithms: EHAEC for one-fault tolerance (EHAEC-1FT) and the active spare selecting algorithm (ASSA). EHAEC-1FT is a variation of EHAEC. It identifies redundant communication routes using the EHAEC tree and guarantees 2-connectivity (i.e., tolerates the failure of one node). The ASSA attempts to find active spare nodes for critical nodes. It uses two impact factors, I± and I² , which can be adjusted so that the result is either more fault tolerant or energy efficient. The spare nodes fix failures by replacing them. In our simulations, EHAEC was 3.4 to 4.8 times more energy efficient than direct data transmission, and thus extended the WSN lifetime. EHAEC-1FT outperformed EHAEC in terms of energy efficiency when fault tolerance was the most important, and a fault tolerant redundancy was created when or before a failure occurred. Moreover, we demonstrated that the ASSA was more energy efficient than EHAEC-1FT, and the effect of using different I± and I² .","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124365622","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

Checkpointing Strategies for Scheduling Computational Workflows 计算工作流调度的检查点策略

Int. J. Netw. Comput. Pub Date : 2016-01-12 DOI: 10.15803/IJNC.6.1_2

G. Aupy, A. Benoit, H. Casanova, Y. Robert

引用次数: 14

Overhead-aware Load Distribution and System Shutdown for Energy-Efficient Computing 面向节能计算的开销感知负载分配和系统停机

Int. J. Netw. Comput. Pub Date : 2015-07-10 DOI: 10.15803/IJNC.5.2_304

Jörg Lenhardt, W. Schiffmann

{"title":"Overhead-aware Load Distribution and System Shutdown for Energy-Efficient Computing","authors":"Jörg Lenhardt, W. Schiffmann","doi":"10.15803/IJNC.5.2_304","DOIUrl":"https://doi.org/10.15803/IJNC.5.2_304","url":null,"abstract":"The energy consumption of server farms is steadily increasing. This is mainly due to an increasing number of servers which are often underutilized most of the time. In this paper we discuss various strategies to improve the energy efficiency of a datacenter measured by the average number of operations executed per Joule. We assume a collection of heterogeneous server nodes that are characterized by their SPECpower-benchmarks. If a time-variable divisible (work)load should to be executed on such a datacenter the energy efficiency can be improved by a smart decomposition of this load into appropriate chunks. In the paper we discuss a sophisticated load distribution strategy and extend it by an adaptive power management for dynamically switching underutilized servers to performance states with lower energy consumption. Of course, also transitions to higher performance/energy states are possible if required by the current load. We introduce a new time slice model that allows a reduction of the switching overhead by means of a few merge and adjust cycles. The resulting ALD+ strategy was evaluated in a webserver environment with real Wikipedia traces. It achieved significant reductions of the energy consumption by the combination of load distribution and server switching by means of the time slice model. Moreover, ALD+ can be easily integrated into any parallel webserver setup.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":" 26","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120825868","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

Preface: Special Issue on the Second International Symposium on Computing and Networking 前言:第二届计算与网络国际研讨会特刊

Int. J. Netw. Comput. Pub Date : 2015-07-10 DOI: 10.15803/IJNC.5.2_252

K. Nakano

引用次数: 0

Enumerating Joint Weight of a Binary Linear Code Using Parallel Architectures: multi-core CPUs and GPUs 利用并行架构枚举二进制线性代码的联合权重:多核cpu和gpu

Int. J. Netw. Comput. Pub Date : 2015-07-10 DOI: 10.15803/IJNC.5.2_290

Shohei Ando, Fumihiko Ino, T. Fujiwara, K. Hagihara

引用次数: 3

Hypercube Fault Tolerant Routing with Bit Constraint 具有位约束的超立方体容错路由

Int. J. Netw. Comput. Pub Date : 2015-07-10 DOI: 10.15803/IJNC.5.2_272

A. Bossard, K. Kaneko

{"title":"Hypercube Fault Tolerant Routing with Bit Constraint","authors":"A. Bossard, K. Kaneko","doi":"10.15803/IJNC.5.2_272","DOIUrl":"https://doi.org/10.15803/IJNC.5.2_272","url":null,"abstract":"Thanks to its simple definition, the hypercube topology is very popular as interconnection network of parallel systems. There have been several routing algorithms described for the hypercube topology, yet in this paper we focus on hypercube routing extended with an additional restriction: bit constraint. Concretely, path selection is performed on a particular subset of nodes: the nodes are required to satisfy a condition regarding their bit weights (a.k.a. Hamming weights). There are several applications to such restricted routing, including simplification of disjoint paths routing. We propose in this paper two hypercube routing algorithms enforcing such node restriction: first, a shortest path routing algorithm, second a fault tolerant point-to-point routing algorithm. Formal proof of correctness and complexity analysis for the described algorithms are conducted. We show that the shortest path routing algorithm proposed is time optimal. Finally, we perform an empirical evaluation of the proposed fault tolerant point-to-point routing algorithm so as to inspect its practical behaviour.Â Along with this experimentation, we analyse further the average performance of the proposed algorithm by discussing the average Hamming distance in a hypercube when satisfying a bit constraint.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131026765","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

Extensions of Access-Point Aggregation Algorithm for Large-scale Wireless Local Area Networks 大规模无线局域网接入点聚合算法的扩展

Int. J. Netw. Comput. Pub Date : 2015-01-10 DOI: 10.15803/IJNC.5.1_200

Md. Ezharul Islam, N. Funabiki, T. Nakanishi

{"title":"Extensions of Access-Point Aggregation Algorithm for Large-scale Wireless Local Area Networks","authors":"Md. Ezharul Islam, N. Funabiki, T. Nakanishi","doi":"10.15803/IJNC.5.1_200","DOIUrl":"https://doi.org/10.15803/IJNC.5.1_200","url":null,"abstract":"Recently, many organizations such as universities and companies have deployed wireless local area networks (WLANs) to cover the whole site for ubiquitous network services. In these WLANs, wireless access-points (APs) are often managed independently by different groups such as laboratories or departments. Then, a host may detect signals from multiple APs, which can degrade the communication performance due to radio interferences among them and increase operational costs. Previously, we proposed the AP aggregation algorithm to solve this problem by minimizing the number of active APs through aggregating them using the virtual AP technology . However, our extensive simulations in various instances found that 1) the minimization of active APs sometimes excessively degrades the network performance, and 2) the sequential optimization of host associations does not always reach optimal where slow links are still used. In this paper, we propose two extensions of the AP aggregation algorithm to solve these problems by 1) ensuring the minimum average throughput for any host by adding active APs and 2) further optimizing host associations by changing multiple hosts simultaneously in the host association finalization phase. We verify the effectiveness through simulations in four network instances using the WIMNET simulator.Â","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133945624","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}

引用次数: 8

Linear Performance-Breakdown Model: A Framework for GPU kernel programs performance analysis 线性性能分解模型:GPU内核程序性能分析的框架

Int. J. Netw. Comput. Pub Date : 2015-01-10 DOI: 10.15803/IJNC.5.1_86

Mario Alberto Chapa Martell, Hiroyuki Sato

引用次数: 3

Identification and Elimination of Platform-Specific Code Smells in High Performance Computing Applications 高性能计算应用中平台特定代码气味的识别和消除

Int. J. Netw. Comput. Pub Date : 2015-01-10 DOI: 10.15803/IJNC.5.1_180

Chunyan Wang, S. Hirasawa, H. Takizawa, Hiroaki Kobayashi

{"title":"Identification and Elimination of Platform-Specific Code Smells in High Performance Computing Applications","authors":"Chunyan Wang, S. Hirasawa, H. Takizawa, Hiroaki Kobayashi","doi":"10.15803/IJNC.5.1_180","DOIUrl":"https://doi.org/10.15803/IJNC.5.1_180","url":null,"abstract":"A code smell is a code pattern that might indicate a code or design problem, which makes the application code hard to evolve and maintain. Automatic detection of code smells has been studied to help users find which parts of their application codes should be refactored. However, code smells have not been defined in a formal manner. Moreover, existing detection tools are designed mainly for object-oriented applications, but rarely provided for high performance computing (HPC) applications. HPC applications are usually optimized for a particular platform to achieve a high performance, and hence have special code smells called platform-specific code smells (PSCSs). The purpose of this work is to develop a code smell alert system to help users find PSCSs of HPC applications to improve the performance portability across different platforms. This paper presents a PSCS alert system that is based on an abstract syntax tree (AST) and XML. Code patterns of PSCSs are defined in a formal way using the AST information represented in XML. XML Path Language (XPath) is used to describe those patterns. A database is built to store the transformation recipes written in XSLT files for eliminating detected PSCSs. The recall and precision evaluation results obtained by using real applications show that the proposed system can detect potential PSCSs accurately. The evaluation on performance portability of real applications demonstrates that eliminating PSCSs leads to significant performanceÂ changes and therefore the code portions with detected PSCSs have to be refactored to improve the performance portability across multiple platforms.Â","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127879866","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