Pub Date : 2019-05-15DOI: 10.1504/IJGUC.2019.099686
J. F. Lima, D. D. Domenico
This paper presents a high-level C++ framework to explore multi-CPU and multi-GPU systems called HPSM. HPSM enables execution of parallel loops and reductions simultaneously over CPUs and GPUs using three parallel backends: Serial, OpenMP, and StarPU. We analysed HPSM development effort with AXPY program through two standard metrics (NCLOC and ES). In addition, we evaluated performance and energy with three parallel benchmarks: N-Body, Hotspot, and CFD solver. HPSM reduced code effort by up to 56.9% compared to StarPU C interface, although it resulted in 2.5× more lines of code compared to OpenMP. The CPU-GPU combination attained speedup results with Hotspot of up to 92.7× on a X86-based system with four GPUs and up to 108.2× on an IBM POWER8+ system with two GPUs. On both systems, the addition of GPUs improved energy efficiency.
{"title":"HPSM: a programming framework to exploit multi-CPU and multi-GPU systems simultaneously","authors":"J. F. Lima, D. D. Domenico","doi":"10.1504/IJGUC.2019.099686","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.099686","url":null,"abstract":"This paper presents a high-level C++ framework to explore multi-CPU and multi-GPU systems called HPSM. HPSM enables execution of parallel loops and reductions simultaneously over CPUs and GPUs using three parallel backends: Serial, OpenMP, and StarPU. We analysed HPSM development effort with AXPY program through two standard metrics (NCLOC and ES). In addition, we evaluated performance and energy with three parallel benchmarks: N-Body, Hotspot, and CFD solver. HPSM reduced code effort by up to 56.9% compared to StarPU C interface, although it resulted in 2.5× more lines of code compared to OpenMP. The CPU-GPU combination attained speedup results with Hotspot of up to 92.7× on a X86-based system with four GPUs and up to 108.2× on an IBM POWER8+ system with two GPUs. On both systems, the addition of GPUs improved energy efficiency.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129522399","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 : 2019-05-15DOI: 10.1504/IJGUC.2019.10021321
David Guyon, Anne-Cécile Orgerie, C. Morin, D. Agarwal
Services offered by cloud computing are convenient to users for reasons such as their ease of use, flexibility, and financial model. Yet data centres used for their execution are known to consume massive amounts of energy. The growing resource utilisation following the cloud success highlights the importance of the reduction of its energy consumption. This paper investigates a way to reduce the footprint of HPC cloud users by varying the size of the virtual resources they request. We analyse the influence of concurrent applications with different resources sizes on the system energy consumption. Simulation results show that resources with larger size are more energy consuming regardless of faster completion of applications. Although smaller-sized resources offer energy savings, it is not always favourable in terms of energy to reduce too much the size. High energy savings depend on the user profiles' distribution.
{"title":"Involving users in energy conservation: a case study in scientific clouds","authors":"David Guyon, Anne-Cécile Orgerie, C. Morin, D. Agarwal","doi":"10.1504/IJGUC.2019.10021321","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10021321","url":null,"abstract":"Services offered by cloud computing are convenient to users for reasons such as their ease of use, flexibility, and financial model. Yet data centres used for their execution are known to consume massive amounts of energy. The growing resource utilisation following the cloud success highlights the importance of the reduction of its energy consumption. This paper investigates a way to reduce the footprint of HPC cloud users by varying the size of the virtual resources they request. We analyse the influence of concurrent applications with different resources sizes on the system energy consumption. Simulation results show that resources with larger size are more energy consuming regardless of faster completion of applications. Although smaller-sized resources offer energy savings, it is not always favourable in terms of energy to reduce too much the size. High energy savings depend on the user profiles' distribution.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130497826","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 : 2019-03-07DOI: 10.1504/IJGUC.2019.10018608
M. Medhioub, Mohamed Hamdi
The use of remote storage systems is gaining an expanding interest, namely the cloud storage-based services. In fact, one of the factors that led to the popularity of cloud computing is the availability of storage resources provided at a reduced cost. However, when outsourcing the data to a third party, security issues become critical concerns, especially confidentiality, integrity, authentication, anonymity and resiliency. Based on this challenge, this work provides a new approach to ensure authentication in cloud storage applications. ID-Based Cryptosystems (IBC) have many advantages over certificate-based systems, such as simplification of key management. This paper proposes an original ID-based authentication approach in which the cloud tenant is assigned the IBC-Private Key Generator (PKG) function. Consequently, it can issue public elements for its users, and can keep confidential resulting IBC secrets. Moreover, in our scheme, the public key infrastructure is still in usage to establish trust relationships between the PKGs.
{"title":"An identity-based cryptographic scheme for cloud storage applications","authors":"M. Medhioub, Mohamed Hamdi","doi":"10.1504/IJGUC.2019.10018608","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10018608","url":null,"abstract":"The use of remote storage systems is gaining an expanding interest, namely the cloud storage-based services. In fact, one of the factors that led to the popularity of cloud computing is the availability of storage resources provided at a reduced cost. However, when outsourcing the data to a third party, security issues become critical concerns, especially confidentiality, integrity, authentication, anonymity and resiliency. Based on this challenge, this work provides a new approach to ensure authentication in cloud storage applications. ID-Based Cryptosystems (IBC) have many advantages over certificate-based systems, such as simplification of key management. This paper proposes an original ID-based authentication approach in which the cloud tenant is assigned the IBC-Private Key Generator (PKG) function. Consequently, it can issue public elements for its users, and can keep confidential resulting IBC secrets. Moreover, in our scheme, the public key infrastructure is still in usage to establish trust relationships between the PKGs.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133315874","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 : 2019-03-07DOI: 10.1504/IJGUC.2019.10018612
Haoxuan Li, P. D. Meulenaere, Siegfried Mercelis, P. Hellinckx
Timing analysis is used to extract the timing properties of a system. Various timing analysis techniques and tools have been developed over the past decades. However, changes in hardware platform and software architecture introduced new challenges in timing analysis techniques. In our research, we aim to develop a hybrid approach to provide safe and precise timing analysis results. In this approach, we will divide the original code into smaller code blocks, and then construct a timing model based on the information acquired by measuring the execution time of every individual block. This process can introduce changes in the software architecture. In this paper, we use a multi-component benchmark to investigate the impact of software architecture on the timing behaviour of a system.
{"title":"Impact of software architecture on execution time: a power window TACLeBench case study","authors":"Haoxuan Li, P. D. Meulenaere, Siegfried Mercelis, P. Hellinckx","doi":"10.1504/IJGUC.2019.10018612","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10018612","url":null,"abstract":"Timing analysis is used to extract the timing properties of a system. Various timing analysis techniques and tools have been developed over the past decades. However, changes in hardware platform and software architecture introduced new challenges in timing analysis techniques. In our research, we aim to develop a hybrid approach to provide safe and precise timing analysis results. In this approach, we will divide the original code into smaller code blocks, and then construct a timing model based on the information acquired by measuring the execution time of every individual block. This process can introduce changes in the software architecture. In this paper, we use a multi-component benchmark to investigate the impact of software architecture on the timing behaviour of a system.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125678318","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 : 2019-03-07DOI: 10.1504/IJGUC.2019.10018615
Kosuke Ozera, Takaaki Inaba, Kevin Bylykbashi, Shinji Sakamoto, Makoto Ikeda, L. Barolli
Many devices communicate over Wireless Local Area Networks (WLANs). The IEEE 802.11e standard for WLANs is an important extension of the IEEE 802.11 standard focusing on Quality of Service (QoS) that works with any PHY implementation. The IEEE 802.11e standard introduces Enhanced Distributed Channel Access (EDCA) and HCF Controlled Channel Access (HCCA). Both these schemes are useful for QoS provisioning to support delay-sensitive voice and video applications. EDCF uses the contention window to differentiate high-priority and low-priority services. However, it does not consider the priority of users. In this paper, in order to deal with this problem, we propose a Fuzzy-based Admission Control System (FACS). We implemented a triage testbed using FACS and carried out an experiment. The experimental results show that the number of connected clients is increased during Avoid phase, but does not change during Monitoring phase. The experimental results show that the implemented testbed performs better than conventional WLAN.
{"title":"A WLAN triage testbed based on fuzzy logic and its performance evaluation for different number of clients and throughput parameter","authors":"Kosuke Ozera, Takaaki Inaba, Kevin Bylykbashi, Shinji Sakamoto, Makoto Ikeda, L. Barolli","doi":"10.1504/IJGUC.2019.10018615","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10018615","url":null,"abstract":"Many devices communicate over Wireless Local Area Networks (WLANs). The IEEE 802.11e standard for WLANs is an important extension of the IEEE 802.11 standard focusing on Quality of Service (QoS) that works with any PHY implementation. The IEEE 802.11e standard introduces Enhanced Distributed Channel Access (EDCA) and HCF Controlled Channel Access (HCCA). Both these schemes are useful for QoS provisioning to support delay-sensitive voice and video applications. EDCF uses the contention window to differentiate high-priority and low-priority services. However, it does not consider the priority of users. In this paper, in order to deal with this problem, we propose a Fuzzy-based Admission Control System (FACS). We implemented a triage testbed using FACS and carried out an experiment. The experimental results show that the number of connected clients is increased during Avoid phase, but does not change during Monitoring phase. The experimental results show that the implemented testbed performs better than conventional WLAN.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131773557","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 : 2019-03-07DOI: 10.1504/IJGUC.2019.10018613
Fatma Masmoudi, M. Sellami, M. Loulou, A. Kacem
The widespread adoption of multi-tenancy in the Software as a Service delivery model triggers several data protection issues that could decrease the tenants' trustworthiness. In this context, accountability can be used to strengthen the trust of tenants in the cloud through providing the reassurance of the processing of personal data hosted in the cloud according to their requirements. In this paper, we propose an approach for the accountability management of multi-tenant cloud services allowing: compliance checking of services behaviours with defined accountability requirements based on monitoring rules, accountability-violation detection otherwise, and post-violation analysis based on evidences. A tool-suite is developed and integrated into a middleware to implement our proposal. Finally, experiments we have carried out show the efficiency of our approach relying on some criteria.
{"title":"Accountability management for multi-tenant cloud services","authors":"Fatma Masmoudi, M. Sellami, M. Loulou, A. Kacem","doi":"10.1504/IJGUC.2019.10018613","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10018613","url":null,"abstract":"The widespread adoption of multi-tenancy in the Software as a Service delivery model triggers several data protection issues that could decrease the tenants' trustworthiness. In this context, accountability can be used to strengthen the trust of tenants in the cloud through providing the reassurance of the processing of personal data hosted in the cloud according to their requirements. In this paper, we propose an approach for the accountability management of multi-tenant cloud services allowing: compliance checking of services behaviours with defined accountability requirements based on monitoring rules, accountability-violation detection otherwise, and post-violation analysis based on evidences. A tool-suite is developed and integrated into a middleware to implement our proposal. Finally, experiments we have carried out show the efficiency of our approach relying on some criteria.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122727510","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 : 2019-03-07DOI: 10.1504/IJGUC.2019.10018617
F. Volpato, Madalena Pereira da Silva, M. Dantas
The exponential growth of online devices has been causing difficulties to network management and maintenance. At the same time, we have noticed that applications are getting richer in terms of content and quality, thus requiring more and more network guarantees. To overcome this issue, new network approaches such as Software-Defined Networking (SDN), have emerged. OpenFlow, which is one of the most used protocols for SDN, is not enough to provide QoS based on queue prioritisation. In this paper we propose an architecture of a controller module that implements the Open vSwitch Database Management Protocol (OVSDB) in order to provide QoS management with queue prioritisation. Our module differs from others because it features mechanisms to test and facilitate user configuration. Our experiments showed that our module behaved as expected, causing few delays when managing switch elements, therefore making a useful tool for QoS management on SDN.
{"title":"OFQuality: a quality of service management module for software-defined networking","authors":"F. Volpato, Madalena Pereira da Silva, M. Dantas","doi":"10.1504/IJGUC.2019.10018617","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10018617","url":null,"abstract":"The exponential growth of online devices has been causing difficulties to network management and maintenance. At the same time, we have noticed that applications are getting richer in terms of content and quality, thus requiring more and more network guarantees. To overcome this issue, new network approaches such as Software-Defined Networking (SDN), have emerged. OpenFlow, which is one of the most used protocols for SDN, is not enough to provide QoS based on queue prioritisation. In this paper we propose an architecture of a controller module that implements the Open vSwitch Database Management Protocol (OVSDB) in order to provide QoS management with queue prioritisation. Our module differs from others because it features mechanisms to test and facilitate user configuration. Our experiments showed that our module behaved as expected, causing few delays when managing switch elements, therefore making a useful tool for QoS management on SDN.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128502331","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 : 2019-03-07DOI: 10.1504/IJGUC.2019.10018616
Akash Punhani, Pardeep Kumar, Nitin
In recent years, Network on Chip (NoC) is used to handle the communication issues between cores or processing elements. The major drawback of existing XY routing algorithm for mesh topology is its inability to handle a high traffic load. In this paper, an E-XY (Entropy based XY) routing algorithm is proposed to generate information about the adjacent router based on previously communicated packets. Tests have been carried out on a mesh topology of 8x8 simulated using Omnet++ 4.4.1 using HNOCS version. Different types of traffic have been considered for result computation including uniform, bit complement, neighbour and tornado. The proposed algorithm is compared with other routing algorithms including XY, IX/Y and Odd Even. Results demonstrate that the proposed algorithm is comparable to XY routing algorithm up to the load factor of 0.8 and performs well than the XY, IX/Y and Odd Even routing algorithms with the increase in load.
近年来，片上网络(Network on Chip, NoC)被用于处理核心或处理单元之间的通信问题。现有的网格拓扑XY路由算法的主要缺点是无法处理高流量负载。本文提出了一种基于熵的路由算法(E-XY)，该算法基于之前通信的数据包生成相邻路由器的信息。在使用HNOCS版本的omnet++ 4.4.1模拟的8x8网格拓扑上进行了测试。结果计算考虑了均匀、位补、邻居和龙卷风等不同类型的流量。将该算法与XY、IX/Y和奇偶路由算法进行了比较。结果表明，在负载因子为0.8的情况下，该算法与XY路由算法相当，并且随着负载的增加，其性能优于XY、IX/Y和奇偶路由算法。
{"title":"E-XY: an entropy based XY routing algorithm","authors":"Akash Punhani, Pardeep Kumar, Nitin","doi":"10.1504/IJGUC.2019.10018616","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10018616","url":null,"abstract":"In recent years, Network on Chip (NoC) is used to handle the communication issues between cores or processing elements. The major drawback of existing XY routing algorithm for mesh topology is its inability to handle a high traffic load. In this paper, an E-XY (Entropy based XY) routing algorithm is proposed to generate information about the adjacent router based on previously communicated packets. Tests have been carried out on a mesh topology of 8x8 simulated using Omnet++ 4.4.1 using HNOCS version. Different types of traffic have been considered for result computation including uniform, bit complement, neighbour and tornado. The proposed algorithm is compared with other routing algorithms including XY, IX/Y and Odd Even. Results demonstrate that the proposed algorithm is comparable to XY routing algorithm up to the load factor of 0.8 and performs well than the XY, IX/Y and Odd Even routing algorithms with the increase in load.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133010642","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 : 2019-03-07DOI: 10.1504/IJGUC.2019.10018611
Xiurong Chen, Yixiang Tian
In this paper, we use the combination of Local Linear Embedding (LLE) with Continuous Deep Belief Networks (CDBN) as the input of RBF, and construct a mixed-feature RBF model. However, LLE depends too much on the local domain which is not easy to be determined, so we propose a new method, Kernel Entropy Linear Embedding (KELE) which uses Kernel Entropy Component Analysis (KECA) to transfer the non-linear problem into linear problem. CDBN has the difficulty in confirming network structure and lacks supervision, so we improve the situations by using the kernel entropy information obtained from KECA, which is called KECDBN. In the empirical part, we use the foreign exchange rate time series to examine the effects of the improved methods, and results show that both the KELE and the KECDBN show better effects in reducing dimensionality and extracting features, respectively, an also improve the prediction accuracy of the mixed-feature RBF.
{"title":"The big data mining forecasting model based on combination of improved manifold learning and deep learning","authors":"Xiurong Chen, Yixiang Tian","doi":"10.1504/IJGUC.2019.10018611","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10018611","url":null,"abstract":"In this paper, we use the combination of Local Linear Embedding (LLE) with Continuous Deep Belief Networks (CDBN) as the input of RBF, and construct a mixed-feature RBF model. However, LLE depends too much on the local domain which is not easy to be determined, so we propose a new method, Kernel Entropy Linear Embedding (KELE) which uses Kernel Entropy Component Analysis (KECA) to transfer the non-linear problem into linear problem. CDBN has the difficulty in confirming network structure and lacks supervision, so we improve the situations by using the kernel entropy information obtained from KECA, which is called KECDBN. In the empirical part, we use the foreign exchange rate time series to examine the effects of the improved methods, and results show that both the KELE and the KECDBN show better effects in reducing dimensionality and extracting features, respectively, an also improve the prediction accuracy of the mixed-feature RBF.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126573363","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 : 2019-03-07DOI: 10.1504/IJGUC.2019.10018610
T. Huybrechts, Yorick De Bock, Haoxuan Li, P. Hellinckx
The Worst-Case Execution Time (WCET) of a task is an important value in real-time systems. This metric is used by the scheduler in order to schedule all tasks before their deadlines. However, the code and hardware architecture have a significant impact on the execution time and thus the WCET. Therefore, different analysis methodologies exist to determine the WCET, each with their own advantages and/or disadvantages. In this paper, a hybrid approach is proposed which combines the strengths of two common analysis techniques. The two-layer hybrid model splits the code of tasks into so-called basic blocks. The WCET can be determined by performing execution time measurements on each block and statically combining those results. The COBRA-HPA framework presented in this paper is developed to facilitate the creation of hybrid block models and automate the measurements/analysis process. Additionally, an elaborated discussion on the implementation and performance of the framework is given. In conclusion, the results of the COBRA-HPA framework show a significant reduction in analysis effort while keeping sound WCET predictions for the hybrid method compared to the static and measurement-based approach.
{"title":"COBRA-HPA: a block generating tool to perform hybrid program analysis","authors":"T. Huybrechts, Yorick De Bock, Haoxuan Li, P. Hellinckx","doi":"10.1504/IJGUC.2019.10018610","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10018610","url":null,"abstract":"The Worst-Case Execution Time (WCET) of a task is an important value in real-time systems. This metric is used by the scheduler in order to schedule all tasks before their deadlines. However, the code and hardware architecture have a significant impact on the execution time and thus the WCET. Therefore, different analysis methodologies exist to determine the WCET, each with their own advantages and/or disadvantages. In this paper, a hybrid approach is proposed which combines the strengths of two common analysis techniques. The two-layer hybrid model splits the code of tasks into so-called basic blocks. The WCET can be determined by performing execution time measurements on each block and statically combining those results. The COBRA-HPA framework presented in this paper is developed to facilitate the creation of hybrid block models and automate the measurements/analysis process. Additionally, an elaborated discussion on the implementation and performance of the framework is given. In conclusion, the results of the COBRA-HPA framework show a significant reduction in analysis effort while keeping sound WCET predictions for the hybrid method compared to the static and measurement-based approach.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128594095","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
扫码关注我们
求助内容：
应助结果提醒方式：