发布求助
文献互助 智能选刊 最新文献

2012 Third International Conference on Networking and Computing最新文献

筛选
英文 中文
Hybrid Approaches Based on Simulated Annealing and an Exact Algorithm for Mixed Integer Programming Problems 基于模拟退火和精确算法的混合整数规划问题
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.82
Keitaro Tamaki, Takeshi Tengan, Morikazu Nakamura
{"title":"Hybrid Approaches Based on Simulated Annealing and an Exact Algorithm for Mixed Integer Programming Problems","authors":"Keitaro Tamaki, Takeshi Tengan, Morikazu Nakamura","doi":"10.1109/ICNC.2012.82","DOIUrl":"https://doi.org/10.1109/ICNC.2012.82","url":null,"abstract":"This paper proposes two hybrid approaches based on the exact algorithm and metaheuristic, simulated annealing, for mixed integer programming problems. The first algorithm tries to control the tradeoff between the computation time and the solution quality by reducing the number of variables of the instances to be solved by the exact algorithm. The variable reduction is performed on the basis of searching by simulated annealing in the hybrid algorithm. The second hybrid algorithm considers not only the problem size reduction but also the computation time constraint of searching for the exact algorithm. The experimental evaluation shows that the exact algorithm and SA complement each other and the second hybrid algorithm performs better than the others.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133130707","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
A Chunked File Transfer Method Dynamically Selecting One from TCP and UDP According to Network Conditions 一种分块文件传输方法根据网络情况，在TCP和UDP中动态选择一种
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.32
Junji Manabe, J. Funasaka, K. Ishida
{"title":"A Chunked File Transfer Method Dynamically Selecting One from TCP and UDP According to Network Conditions","authors":"Junji Manabe, J. Funasaka, K. Ishida","doi":"10.1109/ICNC.2012.32","DOIUrl":"https://doi.org/10.1109/ICNC.2012.32","url":null,"abstract":"Nowadays, various contents are provided on the Internet as user's access lines become much broader. In general, most of file transfer applications use TCP on the Internet. Since TCP performance has low tolerance to packet losses, UDP-based file transfer methods which guarantee the reliability of transmitted data by application layer protocols have been proposed. Since UDP does not have congestion control mechanisms inherently, the methods can influence other traffic when congestion occurs. Therefore, we propose a file transfer method which dynamically selects one from TCP and UDP with according to the network condition estimated by the observed packet loss ratio for two constant rate probing UDP flows. As a result, the proposed method shares bandwidth with other flows fairly by selecting TCP when the congestion occurred and yields high performance by doing UDP when the bit error rate is high.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122668257","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
Minimizing garbage size by generating reversible simulations 通过生成可逆模拟最小化垃圾大小
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.73
T. Yokoyama, Holger Bock Axelsen, R. Glück
{"title":"Minimizing garbage size by generating reversible simulations","authors":"T. Yokoyama, Holger Bock Axelsen, R. Glück","doi":"10.1109/ICNC.2012.73","DOIUrl":"https://doi.org/10.1109/ICNC.2012.73","url":null,"abstract":"Reversible simulations can realize any irreversible computation on any r-Turing complete reversible computation model at the expense of additional garbage output. The problem of minimizing the garbage size is an important issue in reversible simulations. We discuss the notion of the minimal garbage size of reversible simulations. Then, we propose a three-stage reversible simulation for minimizing garbage size, the first stage generates specialized irreversible programs, the second translates them into reversible simulations, and the third performs reversible simulation using the generated reversible programs. Two case studies on sorting algorithms suggest that the proposed method generates solutions with minimal garbage size.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123923727","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
Distributed Algorithm for Set K-Cover Problem and its Worst Case Analysis 集k -覆盖问题的分布式算法及其最坏情况分析
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.15
S. Fujita
{"title":"Distributed Algorithm for Set K-Cover Problem and its Worst Case Analysis","authors":"S. Fujita","doi":"10.1109/ICNC.2012.15","DOIUrl":"https://doi.org/10.1109/ICNC.2012.15","url":null,"abstract":"In this paper, we consider the problem of partitioning a given collection of subsets of nodes into k collections such that the average size of each collection is the largest, where the size of a collection is defined as the size of the union of the subsets contained in the collection. At first, we give an upper bound on the performance ratio of Abrams et al.'s approximation algorithm which is known to have a performance ratio of at least 1 - 1/e where e is Napier's constant. The result of numerical calculations indicates that an upper bound is 3/4 +ε for small ε>;0. Next, we design a distributed implementation of Abrams et al.'s algorithm, which is based on the idea of arbitration using a spanning tree. Our algorithm can be used for the periodical switching of active subsets in Wireless Sensor Networks.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115169687","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
Evaluation of Performance Degradation in HPC Applications with VM Consolidation 基于虚拟机整合的高性能计算应用的性能退化评估
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.50
Yuya Hashimoto, K. Aida
{"title":"Evaluation of Performance Degradation in HPC Applications with VM Consolidation","authors":"Yuya Hashimoto, K. Aida","doi":"10.1109/ICNC.2012.50","DOIUrl":"https://doi.org/10.1109/ICNC.2012.50","url":null,"abstract":"This paper investigates the performance degradation in application programs running on virtual machines (VMs) in a physical computing server with a focus on HPC applications. We select three benchmarks as the expected workload in a data center: HPC applications, database applications, and web server applications. Then, we put VMs executing two application programs together in a physical computing server and evaluate the performance degradation in each application program. We also investigate the resource consumption in each application program and the reason for the performance degradation. The experimental results indicate that the interference among VMs executing two HPC application programs with high memory usage and high network I/O in the physical computing server significantly degrades the application performance.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126917776","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}
引用次数: 21
Record Route Elimination (RRE): An Energy-Efficient Broadcast Algorithm 记录路由消除(RRE):一种高效的广播算法
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.45
E. Sandes, J. Bordim, A. Melo, Yasuaki Ito
{"title":"Record Route Elimination (RRE): An Energy-Efficient Broadcast Algorithm","authors":"E. Sandes, J. Bordim, A. Melo, Yasuaki Ito","doi":"10.1109/ICNC.2012.45","DOIUrl":"https://doi.org/10.1109/ICNC.2012.45","url":null,"abstract":"Broadcasting is a fundamental task, being used for neighboring discovery in various medium access control and routing protocols. This paper presents a comparative analysis of various broadcast techniques and topology control mechanisms. Overall, nine topology control mechanisms and seven broadcast protocols are combined, generating sixty-three possible solutions. Among the broadcast algorithms studied, two are proposed in this paper: the Record Route Elimination (RRE) and Record Route Elimination with Distance Prediction (RRE-DP). The simulation results show that the RRE and RRE-DP allow for a significant reduction in energy consumption, regardless of the topology control mechanism associated.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127218965","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}
引用次数: 0
Proposal of Incremental Software Simulation for Reduction of Evaluation Time 一种减少评估时间的增量软件仿真方法
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.58
Atsushi Shina, K. Ootsu, Takeshi Ohkawa, T. Yokota, T. Baba
{"title":"Proposal of Incremental Software Simulation for Reduction of Evaluation Time","authors":"Atsushi Shina, K. Ootsu, Takeshi Ohkawa, T. Yokota, T. Baba","doi":"10.1109/ICNC.2012.58","DOIUrl":"https://doi.org/10.1109/ICNC.2012.58","url":null,"abstract":"Software optimization techniques are necessary to fully utilize modern high-performance computer architectures. In development of the optimization techniques, repetitive simulations are needed to evaluate multiple candidates of optimization methods on partial code of program. Simulation of entire program codes generally takes huge amount of time. Therefore, a problem occurs that repeated simulations make the evaluation time enormously long. In this paper, we propose an incremental software simulation, a method for reduction of evaluation time for the development of software optimization technique by using check pointing and code substitution. Check pointing technique allows us to save and restore simulation process image. We can limit execution of the simulation only to necessary parts of the target programs by using code substitution. Our method can reduce the evaluation time by check pointing the simulation process and by resuming the execution from the checkpoint after modification of the check pointed process image. Evaluation results show that the total simulation time is reduced 34 percents on average in SPEC CPU2000 benchmark programs.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124941631","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
Language Recognition Power of Watson-Crick Automata: Multiheads and Sensing 沃森-克里克自动机的语言识别能力:多头和传感
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.69
K. Aizawa, Masayuki Aoyama, Kazuki Murakami
{"title":"Language Recognition Power of Watson-Crick Automata: Multiheads and Sensing","authors":"K. Aizawa, Masayuki Aoyama, Kazuki Murakami","doi":"10.1109/ICNC.2012.69","DOIUrl":"https://doi.org/10.1109/ICNC.2012.69","url":null,"abstract":"A Watson-Crick automaton is introduced as a computational model of DNA computing framework. In this paper, we introduce a 3-head reverse Watson-Crick finite automaton having three read-only heads but no sensing power. We show that the class of 3-head reverse Watson-Crick finite automata includes the class of simple sticker language and full reading sensing 5'->;3' Watson-Crick finite automata.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125180242","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
A Speed-up Technique for an Auto-Memoization Processor by Reusing Partial Results of Instruction Regions 基于指令区域部分结果重用的自动记忆处理器加速技术
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.17
Kazutaka Kamimura, Ryosuke Oda, Tatsuhiro Yamada, Tomoaki Tsumura, H. Matsuo, Y. Nakashima
{"title":"A Speed-up Technique for an Auto-Memoization Processor by Reusing Partial Results of Instruction Regions","authors":"Kazutaka Kamimura, Ryosuke Oda, Tatsuhiro Yamada, Tomoaki Tsumura, H. Matsuo, Y. Nakashima","doi":"10.1109/ICNC.2012.17","DOIUrl":"https://doi.org/10.1109/ICNC.2012.17","url":null,"abstract":"We have proposed an auto-memoization processor based on computation reuse. The auto-memoization processor dynamically detects functions and loop iterations as reusable blocks, and memoizes them automatically. In the past model, computation reuse cannot be applied if the current input sequence even differs by only one input value from the past input sequences, since processing results will differ. This paper proposes a new partial reuse model, which can apply computation reuse to the early part of a reusable block as long as the early part of the current input sequence matches one of the past sequences. In addition, in order to acquire sufficient benefit from the partial reuse model, we also propose a technique that reduces the searching overhead for memoization table by partitioning it. The result of the experiment with SPEC CPU95 suite benchmarks shows that the new method improves the maximum speedup from 40.6% to 55.1%, and the average speedup from 10.6% to 22.8%.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131385511","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
Kernel Set Problem and its Computation 核集问题及其计算
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.74
Q. Ge, Mitsuru Nakata
{"title":"Kernel Set Problem and its Computation","authors":"Q. Ge, Mitsuru Nakata","doi":"10.1109/ICNC.2012.74","DOIUrl":"https://doi.org/10.1109/ICNC.2012.74","url":null,"abstract":"Given with a graph G and its any isomorphic graph G', a minimum determiner set of G is a minimum set of vertices such that, if these vertices are assigned in one-to-one correspondence between G and G' then correspondences of the remaining vertices of G are uniquely determined. A kernel set is a minimum determiner set with the least number of elements. In this paper, we firstly define determiner set and minimum determiner set properly as well as kernel set. Then we show the related properties and propose algorithms to find minimum determiner set as a previous step toward finding kernel set. Finally, we give an example by applying proposed algorithms to show the usefulness of minimum determiner set as well as kernel set.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130956691","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信