{"title":"A P2P Approach to Scalable Network-Booting","authors":"Shingo Takada, Akira Sato, Yasushi Shinjo, Hisashi Nakai, Akiyoshi Sugiki, K. Itano","doi":"10.1109/ICNC.2012.38","DOIUrl":"https://doi.org/10.1109/ICNC.2012.38","url":null,"abstract":"Network-booting is widely adopted in universities that have to maintain many client computers. In conventional network-booting systems, the primary bottleneck is the disk image distribution servers and the network to these servers. To eliminate this bottleneck, peer-to-peer (P2P) methods must work. However, existing P2P methods, including BitTorrent, do not work well for network-booting because they are highly optimized for distributing an entire large file, while network-booting requires certain parts of a large file. In the present study, aiming to solve the problems described above, we describe a new network-booting system that uses a P2P method. In our P2P-based network-booting system, a client node receives disk blocks not only from central distribution servers but also from the other client nodes that already have the demanded disk blocks. To the best of our knowledge, our network-booting system is the first effective implementation of a network-booting system that uses a P2P method in a local area network. Unlike conventional P2P systems, the proposed network-booting system can deal with demanded parts of a large disk image. We performed experiments with 112 client nodes in real classrooms on a university campus. The results of the experiments show that our implementation scales well as the number of client nodes grows.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"22 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":"123482894","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}
H. Irie, Daisuke Fujiwara, Kazuki Majima, T. Yoshinaga
{"title":"STRAIGHT: Realizing a Lightweight Large Instruction Window by Using Eventually Consistent Distributed Registers","authors":"H. Irie, Daisuke Fujiwara, Kazuki Majima, T. Yoshinaga","doi":"10.1109/ICNC.2012.66","DOIUrl":"https://doi.org/10.1109/ICNC.2012.66","url":null,"abstract":"As the number of cores as well as the network size in a processor chip increases, the performance of each core is more critical for the improvement of the total chip performance. However, to improve the total chip performance, the performance per power or per unit area must be improved, making it difficult to adopt a conventional approach of super scalar extension. In this paper, we explore a new core structure that is suitable for many core processors. We revisit prior studies of new instruction level (ILP) and thread-level parallelism (TLP) architectures and propose our novel STRAIGHT processor architecture. By introducing the scheme of distributed key-value-store to the register file of clustered micro architectures, STRAIGHT directly executes the operation with large logical registers, which are written only once. By discussing the processor structure, micro architecture, and code model, we show that STRAIGHT realizes both large instruction window and lightweight rapid execution, while suppressing the hardware and energy cost. Preliminary estimation results are promising, and show that STRAIGHT improves the single thread performance by about 30%, which is the geometric mean of the SPEC CPU 2006 benchmark suite, without significantly increasing the power and area budget.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"70 3 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":"125973726","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}
Kazuhiro Kinkai, T. Baba, Hiroyoshi Jutori, K. Ootsu, Takeshi Ohkawa, T. Yokota
{"title":"Comparative Study of Path Prediction Method for Speculative Loop Execution","authors":"Kazuhiro Kinkai, T. Baba, Hiroyoshi Jutori, K. Ootsu, Takeshi Ohkawa, T. Yokota","doi":"10.1109/ICNC.2012.52","DOIUrl":"https://doi.org/10.1109/ICNC.2012.52","url":null,"abstract":"Execution path ratio is mostly dominated by two execution paths in program loops. We have developed Two-Path Limited Speculation Method that achieves speed-up in programs using optimization of the most frequent two paths and speculative multi-thread execution of them. The path predictor used in the method predicts the next execution path in Two-Path Limited Speculation Method, and plays an important role in performance improvement of the method. In this paper, we apply several well-known branch prediction methods to the path prediction and evaluate them in terms of mis-prediction ratio. Experimental results show that the mis-prediction ratios of the path predictors vary from 10% to 45%, depending on the benchmark programs, and are 20% on average, the Gshare path predictor performs best in eight path prediction methods.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"23 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":"125402472","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}
{"title":"Towards a Low-Power Accelerator of Many FPGAs for Stencil Computations","authors":"Ryohei Kobayashi, Shinya Takamaeda-Yamazaki, Kenji Kise","doi":"10.1109/ICNC.2012.67","DOIUrl":"https://doi.org/10.1109/ICNC.2012.67","url":null,"abstract":"We have proposed the effective stencil computation method and the architecture by employing multiple small FPGAs with 2D-mech topology. In this paper, we show that our proposed architecture works correctly on the real 2D-mesh connected FPGA array. We developed a software simulator in C++, which emulates our proposed architecture, and implemented two prototype systems in Verilog HDL. One prototype system is for logic verification with communication modules and the other is for estimation of power consumption without communication modules. We run the former prototype system for 2M cycles and check the behavior with the software simulator. Our architecture is developed towards a low-power accelerator of many FPGAs. The evaluation result with the second prototype shows that the system of a single FPGA node with eight floating-point adders and eight floating-point multipliers archives 2.24GFlop/s in 0.16GHz operations with 2.37W power consumption. This performance/W value is about six-times better than NVidia GTX280 GPU card.","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":"121806224","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}
{"title":"Asynchronous Strategy of Parallel Hybrid Approach of GA and EDA for Function Optimization","authors":"S. M. Said, Morikazu Nakamura","doi":"10.1109/ICNC.2012.80","DOIUrl":"https://doi.org/10.1109/ICNC.2012.80","url":null,"abstract":"This paper adapts parallel master-slave estimation of distribution and genetic algorithms (GAs and EDAs) hybridization. The master selects portions of the search space, and slaves perform, in parallel and independently, a GA that solves the problem on the assigned portion of the search space. The master's work is to progressively narrow the areas explored by the slave's GAs, using parallel dynamic K-means clustering to determine the basins of attraction of the search space. Coordination of activities between master and slaves is done in an asynchronous way (i.e. no waiting is entertained among the processes). The proposed asynchronous model has managed to reduce computation time while maintaining the quality of solutions.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"15 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":"121996229","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}
{"title":"Improve the Performance of the Android Operation of External Human Interaction Device","authors":"N. Ogawa, S. Oikawa","doi":"10.1109/ICNC.2012.63","DOIUrl":"https://doi.org/10.1109/ICNC.2012.63","url":null,"abstract":"Smart phones become popular. They have various sensors and connection modules. They employ a mobile operating system for the control of sensors and modules. In this situation, a large amount of data comes to the operating system from sensors and modules. While such data is important for effective operations of smart phones, it is not well known that how it affects the operating system performance. In this paper, we prepare an experiment environment that mimics a smart phone. We selected the Android as an operating system and the Panda board-ES as a target board. The Panda board-ES equips a Bluetooth module. We select Wii Remote to operate the Android via Bluetooth. We implement programs to use Wii Remote as the input device of the Android, and improve this program.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"80 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":"130637894","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}
{"title":"Centralized Algorithms for the Connected Target Coverage in Wireless Sensor Networks","authors":"Tatsuya Shimokawa, A. Fujiwara","doi":"10.1109/ICNC.2012.57","DOIUrl":"https://doi.org/10.1109/ICNC.2012.57","url":null,"abstract":"In wireless sensor network, the connected target cover is a set of connected sensors that covers all discrete targets, and the connected target coverage is a problem that divides a set of sensors into connected target covers. In this paper, we propose four centralized algorithms for the connected target coverage problem. In addition, we implement the proposed algorithms and existing algorithms in an experimental environment, and show that two proposed algorithms achieve the best result for the problem.","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":"130831088","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}
Shinpei Soda, Masahide Nakamura, S. Matsumoto, S. Izumi, H. Kawaguchi, M. Yoshimoto
{"title":"Handsfree Voice Interface for Home Network Service Using a Microphone Array Network","authors":"Shinpei Soda, Masahide Nakamura, S. Matsumoto, S. Izumi, H. Kawaguchi, M. Yoshimoto","doi":"10.1109/ICNC.2012.37","DOIUrl":"https://doi.org/10.1109/ICNC.2012.37","url":null,"abstract":"The voice control is a promising user interface for the home network system (HNS). In our previous interface, a user had to be equipped with an actual microphone device, which imposed a burden on the user. This paper presents a hands-free voice interface using a microphone array network. The microphone array network enables voice quality enhancement, as well as sound source localization, by networking multiple microphone arrays. Attaching the arrays to the walls or ceiling, users can input voice operations to the HNS from anywhere in the room, without being aware of the microphone devices. We implement a prototype system with a 16ch microphone array, and evaluate the speech recognition rate and the accuracy of sound source localization in a real home network environment. A hands-free operation service and an automatic speech logging service are implemented.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"17 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":"115820024","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}
Shun Motomura, T. Isokawa, H. Kawa, S. Nakashima, N. Kamiura, N. Matsui
{"title":"On Improvement of Anchor-Free Localization in Zigbee Sensor Network","authors":"Shun Motomura, T. Isokawa, H. Kawa, S. Nakashima, N. Kamiura, N. Matsui","doi":"10.1109/ICNC.2012.70","DOIUrl":"https://doi.org/10.1109/ICNC.2012.70","url":null,"abstract":"A localization scheme for wireless sensor networks is presented in this paper. The presented scheme is an anchor free scheme, in which none of geometrical information is necessary for sensor nodes. Thus, only local interaction among sensor nodes is required for estimating the locations of the sensor nodes. This scheme employs the link quality indicator (LQI) and hop count between the sensor nodes for estimation. Our experiments involve the implementation of the proposed scheme on Zigbee sensor modules. The results of the experiments indicate that estimation can be successfully carried out for networks comprising four sensor nodes.","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":"117343917","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}
{"title":"Skyline Queries for Spatial Objects: A Method for Selecting Spatial Objects Based on Surrounding Environments","authors":"Zhiming Chen, M. Arefin, Y. Morimoto","doi":"10.1109/ICNC.2012.40","DOIUrl":"https://doi.org/10.1109/ICNC.2012.40","url":null,"abstract":"A skyline query finds objects that are not dominated by another object from a given set of objects. Skyline queries help us to filter unnecessary information efficiently and provide us clues for various decision making tasks. In this paper, we present a method for computing spatial skyline objects such as hotels. Conventional skyline queries select hotels based on non-spatial attributes of hotels such as price and rating. However, they do not utilize surrounding environments well. In contrast, the proposed method takes into account surrounding facilities of each hotel such as restaurants and supermarkets that are close to the hotel when we select skyline hotels. Like the hotel example, when we select a spatial object in a database, surrounding environment is as important as other attributes. Therefore, the proposed skyline query function is significant for spatial databases.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"56 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":"130789747","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}