{"title":"Programming Education at High Schools and Universities: Design, Development, and Assessment","authors":"E. Takaoka, Takayuki Yonezu, T. Namekawa","doi":"10.2197/IPSJTRANS.8.1","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.8.1","url":null,"abstract":"We designed, developed, and evaluated computer programming education at high schools and universities in 2012 and 2013 to offer students an opportunity to experience practical programming. We provided a programming course to a high school, preparing content-rich materials. In order to generate motivation for learning in students, we set “to create practical applications” as a goal of the course. In 2012, only a few students could create practical applications; however, in 2013, we improved the teaching methods and by the end of the course, almost half of the participants were able to produce practical applications. In addition, some students applied their programs for the Live E! science contest and they received prizes in 2012 and two students applied and one of them received a prize in 2013. An additional notable outcome of the course that we provided was the extent to which first-year students became interested in programming.","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115704647","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":"Parallel Java Code Generation for Layer-unified Coarse Grain Task Parallel Processing","authors":"A. Yoshida, Yuki Ochi, N. Yamanouchi","doi":"10.2197/IPSJTRANS.7.168","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.7.168","url":null,"abstract":"Multicore processors are widely used for various types of computers. In order to achieve high-performance on such multicore systems, it is necessary to extract coarse grain task parallelism from a target program in addition to loop parallelism. Regarding the development of parallel programs, Java or a Java-extension language represents an attractive choice recently, thanks to its performance improvement as well as its platform independence. Therefore, this paper proposes a parallel Java code generation scheme that realizes coarse grain task parallel processing with layerunified execution control. In this parallel processing, coarse grain tasks of all layers are collectively managed through a dynamic scheduler. In addition, we have developed a prototype parallelizing compiler for Java programs with directives. In performance evaluations, the compiler-generated parallel Java code was confirmed to attain high performance. Concretely, we obtained 7.82 times faster speed-up for the Jacobi program, 7.38 times faster speed-up for the Turb3d program, 6.54 times faster speed-up for the Crypt program, and 6.15 times faster speed-up for the MolDyn program on eight cores of Xeon E5-2660.","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131768261","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":"Co-migration of Virtual Machines with Synchronization for IDS Offloading","authors":"Kenichi Kourai, H. Utsunomiya","doi":"10.2197/IPSJTRANS.7.157","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.7.157","url":null,"abstract":"Since Infrastructure-as-a-Service (IaaS) clouds contain many vulnerable virtual machines (VMs), intrusion detection systems (IDSes) should be run for all the VMs. IDS offloading is promising for this purpose because it allows IaaS providers to run IDSes outside of VMs without any cooperation of the users. However, offloaded IDSes cannot continue to monitor their target VM when the VM is migrated to another host. In this paper, we propose VMCoupler for enabling co-migration of offloaded IDSes and their target VM. Our approach is running offloaded IDSes in a special VM called a guard VM, which can monitor the internals of a target VM using VM introspection. VMCoupler can migrate a guard VM together with its target VM and restore the state of VM introspection at the destination. The migration processes of these two VMs are synchronized so that a target VM does not run without being monitored. We have confirmed that the overhead of monitoring and co-migration was small.","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131440049","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":"Parallel Tree Contraction with Fewer Types of Primitive Contraction Operations and Its Application to Trees of Unbounded Degree","authors":"Akimasa Morihata, Kiminori Matsuzaki","doi":"10.2197/IPSJTRANS.7.148","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.7.148","url":null,"abstract":"","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131662762","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":"A GPU Implementation of a Bit-parallel Algorithm for Computing the Longest Common Subsequence","authors":"Katsuya Kawanami, N. Fujimoto","doi":"10.2197/IPSJTRANS.7.139","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.7.139","url":null,"abstract":": The longest common subsequence (LCS) for two given strings has various applications, such as for the comparison of deoxyribonucleic acid (DNA). In this paper, we propose a graphics processing unit (GPU) algorithm to accelerate Hirschberg’s LCS algorithm improved with Crochemore et al.’s bit-parallel algorithm. Crochemore et al.’s algorithm includes bitwise logical operators, which can be computed easily in parallel because they have bitwise parallelism. However, Crochemore et al.’s algorithm also includes an operator with less parallelism, i.e., an arithmetic sum. In this paper, we focus on how to implement these operators e ffi ciently in parallel and experimentally show the following results. First, the proposed GPU algorithm with a 2.67GHz Intel Core i7 920 CPU and GeForce GTX 580 GPU performs a maximum of 12.81 times faster than the bit-parallel CPU algorithm using a single-core 2.67GHz Intel Xeon X5550 CPU. Subsequently, the proposed GPU algorithm executes a maximum of 4.56 times faster than the bit-parallel CPU algorithm using a four-core 2.67GHz Intel Xeon X5550 CPU. Furthermore, the proposed algorithm with GeForce 8800 GTX performs 10.9 to 18.1 times faster than Kloetzli et al.’s existing GPU algorithm with the same GPU.","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126664183","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":"An On-The-Fly Algorithm for Conditional Weighted Pushdown Systems","authors":"Hua Vy Le Thanh, Xin Li","doi":"10.2197/IPSJTRANS.7.132","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.7.132","url":null,"abstract":"Pushdown systems (PDSs) are well-understood as abstract models of recursive sequential programs, and weighted pushdown systems (WPDSs) are a general framework for solving certain meet-over-all-path problems in program analysis. Conditional WPDSs (CWPDSs) further extend WPDSs to enhance the expressiveness of WPDSs, in which each transition is guarded by a regular language over the stack that specifies conditions under which a transition rule can be applied. CWPDSs or its instance are shown to have wide applications in analysis of objected-oriented programs, access rights analysis, etc. Model checking CWPDSs was shown to be reduced to model checking WPDSs, and an offline algorithm was given that translates CWPSs to WPDSs by synchronizing the underlying PDS and finite state automata accepting regular conditions. The translation, however, can cause an exponential blow-up of the system. This paper presents an on-the-fly model checking algorithm for CWPDSs that synchronizes the computing machineries on-demand while computing post-images of regular configurations. We developed an on-the-fly model checker for CWPDSs and apply it to models generated from the reachability analysis of the HTML5 parser specification. Our preliminary experiments show that, the on-the-fly algorithm drastically outperforms the offline algorithm regarding both practical space and time efficiency.","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126079167","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}
Takashi Nakada, K. Okamoto, T. Komoda, Shinobu Miwa, Yohei Sato, Hiroshi Ueki, M. Hayashikoshi, Toru Shimizu, Hiroshi Nakamura
{"title":"Design Aid of Multi-core Embedded Systems with Energy Model","authors":"Takashi Nakada, K. Okamoto, T. Komoda, Shinobu Miwa, Yohei Sato, Hiroshi Ueki, M. Hayashikoshi, Toru Shimizu, Hiroshi Nakamura","doi":"10.2197/IPSJTRANS.7.122","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.7.122","url":null,"abstract":"Shifting to multi-core designs is so pervasive a trend to overcome the power wall and it is a necessary move for embedded systems in our rapidly evolving information society. Meanwhile, the need to increase the battery life and reduce maintenance costs for such embedded systems is very critical. Therefore, a wide variety of power reduction techniques have been proposed and realized, including Clock Gating, DVFS and Power Gating. To maximize the effec- tiveness of these techniques, task scheduling is a key but for multi-core systems it is very complicated due to the huge exploration space. This problem is a major obstacle for further power reduction. To cope with it, we propose a design method for embedded systems to minimize their energy consumption under performance constraints. This method is based on the clarification of properties of the above mentioned low power techniques and their interactions. In more details, we firstly establish energy models for these low power techniques and our target systems. We then explore for the best configuration by constructing an optimization problem especially for applications which have a longer deadline than the execution interval. Finally, we propose an approximate solution using dynamic programming with a lower computation complexity and compare it to a brute force explicit solution. We confirm with our evaluations that the proposed method successfully found a better configuration which reduces the total energy consumption by 32% if compared to the manually optimized configuration, which utilizes only one core.","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126148767","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":"Checking Time Linearity of Regular Expression Matching Based on Backtracking","authors":"S. Sugiyama, Yasuhiko Minamide","doi":"10.2197/IPSJTRANS.7.82","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.7.82","url":null,"abstract":"Most implementations of regular expression matching in programming languages are based on backtrack- ing. With this implementation strategy, matching may not be achieved in linear time with respect to the length of the input. In the worst case, it may take exponential time. In this paper, we propose a method of checking whether or not regular expression matching runs in linear time. We construct a top-down tree transducer with regular lookahead that translates the input string into a tree corresponding to the execution steps of matching based on backtracking. The regular expression matching then runs in linear time if the tree transducer is of linear size increase. To check this property of the tree transducer, we apply a result of Engelfriet and Maneth. We implemented the method in OCaml and conducted experiments that checked the time linearity of regular expressions appearing in several popular PHP programs. Our implementation showed that 47 of 393 regular expressions were not linear.","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132441491","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}
Shingo Okuno, Tasuku Hiraishi, H. Nakashima, M. Yasugi, J. Sese
{"title":"Parallelization of Extracting Connected Subgraphs with Common Itemsets","authors":"Shingo Okuno, Tasuku Hiraishi, H. Nakashima, M. Yasugi, J. Sese","doi":"10.2197/IPSJTRANS.7.93","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.7.93","url":null,"abstract":"","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125838469","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":"Dividing Huge XML Trees Using the m-bridge Technique over One-to-one Corresponding Binary Trees","authors":"Takayuki Kawamura, Kiminori Matsuzaki","doi":"10.2197/IPSJTRANS.7.111","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.7.111","url":null,"abstract":": Tree data such as XML trees have recently been getting larger and larger. Parallel and distributed process- ing is a promising way of dealing with big data, but we need to divide the data in the first step. Since computation over trees often requires relationships between parents and children and / or among siblings, we should pay attention to such relationships. There is a technique called the “ m -bridge” for dividing trees. We can easily compute m -bridges for trees of any shape. However, division with the m -bridge technique is sometimes unsatisfactory for shallow XML trees. We propose a method of tree division for XML trees in this study, in which we apply the m -bridge technique to a one-to-one corresponding binary tree. We implement the tree division algorithm using the Simple API for XML (SAX) Parser. An important feature of our algorithm is that we transform and divide XML trees in the order that the SAX parser reads the trees. We carried out experiments and discuss the properties of the tree division algorithm we propose. In addition, we discuss how we can use the divided trees with query examples.","PeriodicalId":255095,"journal":{"name":"Ipsj Online Transactions","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114569181","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}