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

Self-Stabilizing Algorithms for Maximal 2-packing and General k-packing (k ≥ 2) with Safe Convergence in an Arbitrary Graph 任意图上安全收敛的最大2-填充和一般k-填充的自稳定算法

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

Yihua Ding, J. Wang, P. Srimani

{"title":"Self-Stabilizing Algorithms for Maximal 2-packing and General k-packing (k ≥ 2) with Safe Convergence in an Arbitrary Graph","authors":"Yihua Ding, J. Wang, P. Srimani","doi":"10.15803/IJNC.5.1_105","DOIUrl":"https://doi.org/10.15803/IJNC.5.1_105","url":null,"abstract":"In a graph or a networkÂ G =( V,E ), a setÂ SâS† V is a 2-packing ifÂ âˆ€ i âˆˆ V : | N [ i ] âˆ©S|â‰¤ 1, where N [ i ] denotes the closed neighborhood of node i . A 2-packing is maximal if no proper superset of S is a 2-packing. This paper presents a safely converging self-stabilizing algorithm for maximal 2-packing problem. Under a synchronous daemon, it quickly converges to a 2- packing (a safe state, not necessarily the legitimate state) in three synchronous steps, and then terminates in a maximal one (the legitimate state) in O ( n ) steps without breaking safety during the convergence interval, where n is the number of nodes. Space requirement at each node is O (log n ) bits. This is a significant improvement over the most recent self-stabilizing algorithm for maximal 2-packing that uses O ( n 2 ) synchronous steps with same space complexity and that does not have safe convergence property. We then generalize the technique to design a self- stabilizing algorithm for maximal k -packing, k â‰¥ 2, with safe convergence that stabilizes in O ( kn 2 ) steps under synchronous daemon; the algorithm has space complexity of O ( kn log n ) bits at each node; existing algorithms for k -packing stabilize in exponential time under a central daemon with O (log n ) space complexity.Â","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":"125401193","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}

引用次数: 3

An Adaptive Routing Algorithm of 2-D Torus Network Based on Turn Model: The Communication Performance 基于转弯模型的二维环面网络自适应路由算法:通信性能

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

Y. Miura, Kentaro Shimozono, Naohisa Fukase, S. Watanabe, Kazuya Matoyama

引用次数: 5

Composing resilience techniques: ABFT, periodic and incremental checkpointing 组合弹性技术:ABFT、周期性和增量检查点

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

G. Bosilca, Aurélien Bouteiller, T. Hérault, Y. Robert, J. Dongarra

{"title":"Composing resilience techniques: ABFT, periodic and incremental checkpointing","authors":"G. Bosilca, Aurélien Bouteiller, T. Hérault, Y. Robert, J. Dongarra","doi":"10.15803/IJNC.5.1_2","DOIUrl":"https://doi.org/10.15803/IJNC.5.1_2","url":null,"abstract":"Algorithm Based Fault Tolerant (ABFT) approaches promise unparalleled scalability and performance in failure-prone environments. Thanks to recent advances in the understanding of the involved mechanisms, a growing number of important algorithms (including all widely used factorizations) have been proven ABFT-capable. In the context of larger applications, these algorithms provide a temporal section of the execution, where the data is protected by its own intrinsic properties, and can therefore be algorithmically recomputed without the need of checkpoints. However, while typical scientific applications spend a significant fraction of their execution time in library calls that can be ABFT-protected, they interleave sections that are difficult or even impossible to protect with ABFT. As a consequence, the only practical fault-tolerance approach for these applications is checkpoint/restart. In this paper we propose a model to investigate the efficiency of a composite protocol, that alternates between ABFT and checkpoint/restart for the effective protection of an iterative application composed of ABFT- aware and ABFT-unaware sections. We also consider an incremental checkpointing composite approach in which the algorithmic knowledge is leveraged by a novel optimal dynamic program- ming to compute checkpoint dates. We validate these models using a simulator. The model and simulator show that the composite approach drastically increases the performance delivered by an execution platform, especially at scale, by providing the means to increase the interval between checkpoints while simultaneously decreasing the volume of each checkpoint.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"131 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":"122409355","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

A Novel Computational Model for GPUs with Applications to Efficient Algorithms 一种新的gpu计算模型及其在高效算法中的应用

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

A. Koike, K. Sadakane

引用次数: 8

Development of an Algorithm for Extracting Parallelism and Pipeline Structure from Stream-based Processing flow with Spanning Tree 基于生成树的流处理流并行性和管道结构提取算法研究

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

S. Yamagiwa, G. Wang, K. Wada

{"title":"Development of an Algorithm for Extracting Parallelism and Pipeline Structure from Stream-based Processing flow with Spanning Tree","authors":"S. Yamagiwa, G. Wang, K. Wada","doi":"10.15803/IJNC.5.1_159","DOIUrl":"https://doi.org/10.15803/IJNC.5.1_159","url":null,"abstract":"It is a fashion to use the manycore accelerators to promote the computing power in a computing platform. Especially GPU is one of the main series of the high performance computing, which is also employed by top supercomputers in the world. Programming methods on such accelerators includes development of control programs which accelerators executes to schedule the invocation of the acceleratorâ€™s kernel program. The kernel program needs to be written based on the stream computing paradigm. Connecting I/Os of the kernel programs, we can develop a large application. When we consider the processing flow as a directed graph, we can implement a GUI-based programming tool for the accelerators. It visualizes a pipeline-based processing flow. However, it is very hard to find a starting point of a complex processing flow. Moreover, although the processing pipeline include the potential parallelism, it is hard for the programmer to exploit it intuitively. This paper proposes an algorithm applying the spanning tree that mechanically exploits the parallelism and determines an execution order. To verify the algorithm, this paper performs evaluation with realistic applications. The algorithm exploits effectively the parallelism and construct the optimal pipeline processing flow.Â","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"33 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":"133980091","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

Handling Non-determinism with Description Logics using a Fork/Join Approach 使用Fork/Join方法处理描述逻辑的非确定性

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

J. Faddoul, W. MacCaull

引用次数: 4

Employing Cooperative Communication to Recover Network Connectivity in Ad Hoc Networks 利用协作通信恢复Ad Hoc网络中的网络连通性

Int. J. Netw. Comput. Pub Date : 2014-07-14 DOI: 10.15803/IJNC.4.2_336

U. R. Afonseca, Thiago F. Neves, J. Bordim

引用次数: 2

Using Optical-Approaches to Raise Energy Efficiency of Future Central and/or Linked Distributed Data Center Network Services 使用光学方法提高未来中央和/或分布式数据中心网络服务的能源效率

Int. J. Netw. Comput. Pub Date : 2014-07-14 DOI: 10.15803/IJNC.4.2_209

N. Yamanaka, H. Takeshita, S. Okamoto, Takehiro Sato