Pub Date : 2014-06-01DOI: 10.1109/SNPD.2014.6888724
Satoshi Takatori, S. Matsumoto, S. Saiki, Masahide Nakamura
A home network system (HNS) provides value-added services for home users by networking house-hold appliances and sensors. In the conventional architecture, the HNS appliances and services are tightly coupled. It is therefore difficult for users to freely choose their favorite appliances and services. In this paper, we propose a new HNS architecture that accommodates multi-vendor services by extensively using cloud technologies. The new architecture manages individual HNS operations and data as standard services within the cloud. The vendor services must go through the cloud to access the HNS. Thus, loose coupling among the HNS and services can be achieved. As a result, the proposed architecture realizes more flexible HNS beneficial for both users and vendors.
{"title":"A proposal of cloud-based home network system for multi-vendor services","authors":"Satoshi Takatori, S. Matsumoto, S. Saiki, Masahide Nakamura","doi":"10.1109/SNPD.2014.6888724","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888724","url":null,"abstract":"A home network system (HNS) provides value-added services for home users by networking house-hold appliances and sensors. In the conventional architecture, the HNS appliances and services are tightly coupled. It is therefore difficult for users to freely choose their favorite appliances and services. In this paper, we propose a new HNS architecture that accommodates multi-vendor services by extensively using cloud technologies. The new architecture manages individual HNS operations and data as standard services within the cloud. The vendor services must go through the cloud to access the HNS. Thus, loose coupling among the HNS and services can be achieved. As a result, the proposed architecture realizes more flexible HNS beneficial for both users and vendors.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122233678","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}
Pub Date : 2014-06-01DOI: 10.1109/SNPD.2014.6888708
Yasong Zheng, Yuanchao Xu, Haibo Meng, Xiaochun Ye, Lingjun Fan, Futao Miao, Dongrui Fan
MapReduce is a popular parallel programming model to program both large scale clusters and shared-memory multicore systems. While one of the major bottlenecks for shared-memory MapReduce is memory allocation. In this paper, we present a Memory Controlling Model (MCM) that can reduce the overhead of memory allocation by reducing the memory consumption. Based on MCM, we extend the MapReduce framework with low memory requirements, called LMMR (Low Memory consuming MapReduce). We have implemented LMMR on top of Phoenix++, an already highly optimized shared-memory MapReduce from Stanford. We evaluate our system on an Intel shared-memory multicore machine with 16 processing threads and compare it with both Phoenix++ and Hadoop. Experiments on three different popular applications show that, compared to Phoenix++, LMMR saves up to 94% memory and results in a speedup ranging from 1.8X to 3.7X. LMMR also is up to 120 times faster than Hadoop.
MapReduce是一种流行的并行编程模型，用于为大规模集群和共享内存多核系统编程。而共享内存MapReduce的主要瓶颈之一是内存分配。本文提出了一种内存控制模型(Memory control Model, MCM)，该模型可以通过减少内存消耗来减少内存分配的开销。在MCM的基础上，我们扩展了低内存需求的MapReduce框架，称为LMMR (low memory consuming MapReduce)。我们已经在菲尼克斯++上实现了LMMR，这是斯坦福大学已经高度优化的共享内存MapReduce。我们在一台英特尔共享内存多核机器上评估了我们的系统，该机器有16个处理线程，并将其与Phoenix++和Hadoop进行了比较。在三种不同的流行应用程序上进行的实验表明，与Phoenix++相比，LMMR节省了高达94%的内存，并实现了1.8到3.7倍的加速。LMMR也比Hadoop快120倍。
{"title":"Optimizing mapreduce with low memory requirements for shared-memory systems","authors":"Yasong Zheng, Yuanchao Xu, Haibo Meng, Xiaochun Ye, Lingjun Fan, Futao Miao, Dongrui Fan","doi":"10.1109/SNPD.2014.6888708","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888708","url":null,"abstract":"MapReduce is a popular parallel programming model to program both large scale clusters and shared-memory multicore systems. While one of the major bottlenecks for shared-memory MapReduce is memory allocation. In this paper, we present a Memory Controlling Model (MCM) that can reduce the overhead of memory allocation by reducing the memory consumption. Based on MCM, we extend the MapReduce framework with low memory requirements, called LMMR (Low Memory consuming MapReduce). We have implemented LMMR on top of Phoenix++, an already highly optimized shared-memory MapReduce from Stanford. We evaluate our system on an Intel shared-memory multicore machine with 16 processing threads and compare it with both Phoenix++ and Hadoop. Experiments on three different popular applications show that, compared to Phoenix++, LMMR saves up to 94% memory and results in a speedup ranging from 1.8X to 3.7X. LMMR also is up to 120 times faster than Hadoop.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129648331","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}
Pub Date : 2014-06-01DOI: 10.1109/SNPD.2014.6888732
Taiyou Kikuchi, S. Koka, Koichi Anada, Y. Miyadera, T. Yaku
In this work, the heterogeneous rectangular dissections that represent multi-resolution images of raster data are considered. Specifically, heterogeneous rectangular dissections are changed to triangular dissections in order to provide more effective feature extraction. We propose a method of generating triangular dissections that maintains “octgrid” properties and have developed a list structure suitable for extracting image features (ridges, valleys, etc.) from terrain maps. We propose a detailed list structure called “H12Code” and present examples of feature extraction using H12Code lists.
{"title":"A data structure for triangular dissection of multi-resolution images","authors":"Taiyou Kikuchi, S. Koka, Koichi Anada, Y. Miyadera, T. Yaku","doi":"10.1109/SNPD.2014.6888732","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888732","url":null,"abstract":"In this work, the heterogeneous rectangular dissections that represent multi-resolution images of raster data are considered. Specifically, heterogeneous rectangular dissections are changed to triangular dissections in order to provide more effective feature extraction. We propose a method of generating triangular dissections that maintains “octgrid” properties and have developed a list structure suitable for extracting image features (ridges, valleys, etc.) from terrain maps. We propose a detailed list structure called “H12Code” and present examples of feature extraction using H12Code lists.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121657611","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}
Pub Date : 2014-06-01DOI: 10.1109/SNPD.2014.6888720
T. Hochin, Hiroki Nomiya
It has been shown that pauses, which are considered to be important for transmitting traditional skills, can easily be obtained from the movement of a worker or a player by adjusting several parameters of the similarity test. This paper quantitatively confirms the validity of the values of the parameters. By using these parameter values, pauses in tea ceremony are tried to be derived. It is shown that the movements of a body around pauses are quite similar, and may form a typical and/or fundamental movement. The fluctuation of tempo is also examined from the viewpoint of timing of beats.
{"title":"Considerations on pauses and fundamental movements for transmitting traditional skills","authors":"T. Hochin, Hiroki Nomiya","doi":"10.1109/SNPD.2014.6888720","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888720","url":null,"abstract":"It has been shown that pauses, which are considered to be important for transmitting traditional skills, can easily be obtained from the movement of a worker or a player by adjusting several parameters of the similarity test. This paper quantitatively confirms the validity of the values of the parameters. By using these parameter values, pauses in tea ceremony are tried to be derived. It is shown that the movements of a body around pauses are quite similar, and may form a typical and/or fundamental movement. The fluctuation of tempo is also examined from the viewpoint of timing of beats.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122636112","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}
Pub Date : 2014-06-01DOI: 10.1109/SNPD.2014.6888727
Yoshiharu Ikutani, H. Uwano
Near infrared spectroscopy (NIRS) has been used as a low cost, noninvasive method to measure brain activity. In this paper, we experiment to measure the effects of variables and controls in a source code to the brain activity in program comprehension. The measurement results are evaluated after noise reduction and normalization to statistical analysis. As the result of the experiment, significant differences in brain activity were observed at a task that requires memorizing variables to understand a code snippet. On the other hand, no significant differences between different levels of mental arithmetic tasks were observed. We conclude that the frontal pole reflects workload to short-term memory caused by variables without affected from calculation.
{"title":"Brain activity measurement during program comprehension with NIRS","authors":"Yoshiharu Ikutani, H. Uwano","doi":"10.1109/SNPD.2014.6888727","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888727","url":null,"abstract":"Near infrared spectroscopy (NIRS) has been used as a low cost, noninvasive method to measure brain activity. In this paper, we experiment to measure the effects of variables and controls in a source code to the brain activity in program comprehension. The measurement results are evaluated after noise reduction and normalization to statistical analysis. As the result of the experiment, significant differences in brain activity were observed at a task that requires memorizing variables to understand a code snippet. On the other hand, no significant differences between different levels of mental arithmetic tasks were observed. We conclude that the frontal pole reflects workload to short-term memory caused by variables without affected from calculation.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131490904","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}
Pub Date : 1900-01-01DOI: 10.1109/SNPD.2014.6888711
S. M. Sait, R. Al-Shaikh
Up to writing this paper, existing High Performance Computing (HPC) systems do not provide proper quality of service (QoS) controls and reliability features because of two limitations: first, standard middleware libraries such as Message Passing Interface (MPI) and Parallel Virtual Machine (PVM) do not provide means for applications to specify service quality for computation and communication. Second, modern high-speed interconnects such as Infiniband, Myrinet and Quadrics are optimized for performance rather than fault-tolerance and QoS control. The Data-Centric Publish-Subscribe (DCPS) model - the core of Data Distribution Service (DDS) systems - defines standards that enable applications running on heterogeneous platforms to control various QoS policies in a net-centric system. In this paper, we present our novel model of incorporating DDS QoS and reliability controls into HPC systems. Our results show that DDS integration into HPC adds considerable overheard in terms of performance and network utilization, when the application is mainly communication.
{"title":"High performance and grid computing with quality of service control","authors":"S. M. Sait, R. Al-Shaikh","doi":"10.1109/SNPD.2014.6888711","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888711","url":null,"abstract":"Up to writing this paper, existing High Performance Computing (HPC) systems do not provide proper quality of service (QoS) controls and reliability features because of two limitations: first, standard middleware libraries such as Message Passing Interface (MPI) and Parallel Virtual Machine (PVM) do not provide means for applications to specify service quality for computation and communication. Second, modern high-speed interconnects such as Infiniband, Myrinet and Quadrics are optimized for performance rather than fault-tolerance and QoS control. The Data-Centric Publish-Subscribe (DCPS) model - the core of Data Distribution Service (DDS) systems - defines standards that enable applications running on heterogeneous platforms to control various QoS policies in a net-centric system. In this paper, we present our novel model of incorporating DDS QoS and reliability controls into HPC systems. Our results show that DDS integration into HPC adds considerable overheard in terms of performance and network utilization, when the application is mainly communication.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127968917","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：