Enhancing Dynamic Binary Translation in Mobile Computing by Leveraging Polyhedral Optimization

Dynamic binary translation (DBT) is gaining importance in mobile computing. Mobile Edge Computing (MEC) augments mobile devices with powerful servers, whereas edge servers and smartphones are usually based on heterogeneous architecture. To leverage high-performance resources on servers, code offloading is an ideal approach that relies on DBT. In addition, mobile devices equipped with multicore processors and GPU are becoming ubiquitous. Migrating x86_64 application binaries to mobile devices by using DBT can also make a contribution to providing various mobile applications, e.g., multimedia applications. However, the translation efficiency and overall performance of DBT for application migration are not satisfactory, because of runtime overhead and low quality of the translated code. Meanwhile, traditional DBT systems do not fully exploit the computational resources provided by multicore processors, especially when translating sequential guest applications. In this work, we focus on leveraging ubiquitous multicore processors to improve DBT performance by parallelizing sequential applications during translation. For that, we propose LLPEMU, a DBT framework that combines binary translation with polyhedral optimization. We investigate the obstacles of adapting existing polyhedral optimization in compilers to DBT and present a feasible method to overcome these issues. In addition, LLPEMU adopts static-dynamic combination to ensure that sequential binaries are parallelized while incurring low runtime overhead. Our evaluation results show that LLPEMU outperforms QEMU significantly on the PolyBench benchmark.

Download Full-text

The Shrank YoloV3-tiny for spinal fracture lesions detection

Journal of Intelligent & Fuzzy Systems ◽

10.3233/jifs-212255 ◽

2021 ◽

pp. 1-20

Author(s):

Gang Sha ◽

Junsheng Wu ◽

Bin Yu

Keyword(s):

Mobile Devices ◽

High Performance ◽

Spinal Fracture ◽

Computed Tomography Images ◽

Batch Normalization ◽

Lumbar Fracture ◽

Model Size ◽

Computational Resources ◽

Computer Resources ◽

Novel Model

Purpose: at present, more and more deep learning algorithms are used to detect and segment lesions from spinal CT (Computed Tomography) images. But these algorithms usually require computers with high performance and occupy large resources, so they are not suitable for the clinical embedded and mobile devices, which only have limited computational resources and also expect a relative good performance in detecting and segmenting lesions. Methods: in this paper, we present a model based on Yolov3-tiny to detect three spinal fracture lesions, cfracture (cervical fracture), tfracture (thoracic fracture), and lfracture (lumbar fracture) with a small size model. We construct this novel model by replacing the traditional convolutional layers in YoloV3-tiny with fire modules from SqueezeNet, so as to reduce the parameters and model size, meanwhile get accurate lesions detection. Then we remove the batch normalization layers in the fire modules after the comparative experiments, though the overall performance of fire module without batch normalization layers is slightly improved, we can reduce computation complexity and low occupations of computer resources for fast lesions detection. Results: the experiments show that the shrank model only has a size of 13 MB (almost a third of Yolov3-tiny), while the mAP (mean Average Precsion) is 91.3%, and IOU (intersection over union) is 90.7. The detection time is 0.015 second per CT image, and BFLOP/s (Billion Floating Point Operations per Second) value is less than Yolov3-tiny. Conclusion: the model we presented can be deployed in clinical embedded and mobile devices, meanwhile has a relative accurate and rapid real-time lesions detection.

Download Full-text

High Performance Scheduling Mechanism for Mobile Computing Based on Self-Ranking Algorithm (SRA)

Integrated Approaches in Information Technology and Web Engineering ◽

10.4018/978-1-60566-418-7.ch009 ◽

2009 ◽

pp. 127-142

Author(s):

Hesham A. Ali ◽

Tamer Ahmed Farrag

Keyword(s):

Mobile Computing ◽

Mobile Devices ◽

High Performance ◽

Total Error ◽

Access Point ◽

Programming Approach ◽

Proper Solution ◽

Ranking Algorithm ◽

Computing Environment ◽

Event Based

Due to the rapidly increasing of the mobile devices connected to the internet, a lot of researches are being conducted to maximize the benefit of such integration. The main objective of this paper is to enhance the performance of the scheduling mechanism of the mobile computing environment by distributing some of the responsibilities of the access point among the available attached mobile devices. To this aim we investigate a scheduling mechanism framework that comprises an algorithm provides the mobile device with the authority to evaluate itself as a resource. The proposed mechanism is based on the proposing of “self ranking algorithm (SRA)” which provides a lifetime opportunity to reach a proper solution. This mechanism depends on event-based programming approach to start its execution in a pervasive computing environment. Using such mechanism will simplify the scheduling process by grouping the mobile devices according to their self -ranking value and assign tasks to these groups. Moreover, it will maximize the benefit of the mobile devices incorporated with the already existing grid systems by using their computational power as a subordinate value to the overall power of the system. Furthermore, we evaluate the performance of the investigated algorithm extensively, to show how it overcomes the connection stability problem of the mobile devices. Experimental results emphasized that, the proposed SRA has a great impact in reducing the total error and link utilization compared with the traditional mechanism.

Download Full-text

Server-Aided Verification Signature with Privacy for Mobile Computing

Mobile Information Systems ◽

10.1155/2015/626415 ◽

2015 ◽

Vol 2015 ◽

pp. 1-11 ◽

Cited By ~ 1

Author(s):

Lingling Xu ◽

Jin Li ◽

Shaohua Tang ◽

Joonsang Baek

Keyword(s):

Mobile Computing ◽

Mobile Devices ◽

Data Communication ◽

Wireless Technology ◽

Signature Schemes ◽

Collusion Attacks ◽

Secret Information ◽

Computational Load ◽

Resource Poor ◽

Computational Resources

With the development of wireless technology, much data communication and processing has been conducted in mobile devices with wireless connection. As we know that the mobile devices will always be resource-poor relative to static ones though they will improve in absolute ability, therefore, they cannot process some expensive computational tasks due to the constrained computational resources. According to this problem, server-aided computing has been studied in which the power-constrained mobile devices can outsource some expensive computation to a server with powerful resources in order to reduce their computational load. However, in existing server-aided verification signature schemes, the server can learn some information about the message-signature pair to be verified, which is undesirable especially when the message includes some secret information. In this paper, we mainly study the server-aided verification signatures with privacy in which the message-signature pair to be verified can be protected from the server. Two definitions of privacy for server-aided verification signatures are presented under collusion attacks between the server and the signer. Then based on existing signatures, two concrete server-aided verification signature schemes with privacy are proposed which are both proved secure.

Download Full-text

Pervasive and Grid Computing Merging

Human Computer Interaction ◽

10.4018/978-1-87828-991-9.ch019 ◽

2009 ◽

pp. 254-261

Author(s):

Loreno Oliveira ◽

Emerson Loureiro ◽

Hyggo Almeida ◽

Angelo Perkusich

Keyword(s):

Grid Computing ◽

Mobile Devices ◽

Pervasive Computing ◽

High Performance ◽

Low Cost ◽

Portable Devices ◽

Everyday Objects ◽

Wired Networks ◽

The One ◽

Computational Resources

Nowadays, we are experiencing an increasing use of mobile and embedded devices. These devices, aided by the emergence of new wireless technologies and software paradigms, among other technological conquests, are providing means to accomplish the vision of a new era in computer science. In this vision, the way we create and use computational systems changes drastically for a model where computers loose their “computer appearance.” Their sizes were reduced, cables were substituted by wireless connections, and they are becoming part of everyday objects, such as clothes, automobiles, and domestic equipments. Initially called ubiquitous computing, this paradigm of computation is also known as pervasive computing (Weiser, 1991). It is mainly characterized by the use of portable devices that interact with other portable devices and resources from wired networks to offer personalized services to the users. While leveraging pervasive computing, these portable devices also bring new challenges to the research in this area. The major problems arise from the limitations of the devices. At the same time that pervasive computing was attaining space within the research community, the field of grid computing (Foster, Kesselman, & Tuecke, 2001) was also gaining visibility and growing in maturity and importance. More than just a low cost platform for high performance computing, grid computing emerges as a solution for virtualization and sharing of computational resources. In the context of virtual organizations, both grid and pervasive computing assemble a number of features that are quite desirable for several scenarios within this field, notably the exchanging of information and computational resources among environments and organizations. The features of these technologies are enabling system designers to provide newer and enhanced kinds of services within different contexts, such as industry, marketing, commerce, education, businesses, and convenience. Furthermore, as time goes on, researchers have made attempts of extracting and incorporating the better of the two technologies, thus fostering the evolution of existing solutions and the development of new applications. On the one hand, pervasive computing researchers are essentially interested in using wired grids to hide the limitations of mobile devices. On the other hand, grid computing researchers are broadening the diversity of resources adhered to the grid by incorporating mobile devices. This chapter presents part of our experiences in the research of both pervasive and grid computing. We start with an overview about grid and pervasive technologies. Following, there are described and discussed approaches for combining pervasive and grid computing. These approaches are presented from both perspectives of grid and pervasive computing research. Finally, in the last section, there are presented our criticisms about the approaches discussed and our hopes about the future steps for this blend of technologies.

Download Full-text

High Performance Scheduling Mechanism for Mobile Computing Based on Self-Ranking Algorithm

Mobile Computing ◽

10.4018/978-1-60566-054-7.ch233 ◽

2009 ◽

pp. 3151-3167

Author(s):

Hesham A. Ali ◽

Tamer Ahmed Farrag

Keyword(s):

Mobile Computing ◽

Mobile Devices ◽

High Performance ◽

Total Error ◽

Access Point ◽

Programming Approach ◽

Proper Solution ◽

Ranking Algorithm ◽

Computing Environment ◽

Event Based

Due to the rapidly increasing number of mobile devices connected to the Internet, a lot of research is being conducted to maximize the benefit of such integration. The main objective of this article is to enhance the performance of the scheduling mechanism of the mobile computing environment by distributing some of the responsibilities of the access point among the available attached mobile devices. To this aim, we investigate a scheduling mechanism framework that comprises an algorithm that provides the mobile device with the authority to evaluate itself as a resource. The proposed mechanism is based on the “self ranking algorithm” (SRA), which provides a lifetime opportunity to reach a proper solution. This mechanism depends on an event-based programming approach to start its execution in a pervasive computing environment. Using such a mechanism will simplify the scheduling process by grouping mobile devices according to their self-ranking value and assigning tasks to these groups. Moreover, it will maximize the benefit of the mobile devices incorporated with the already existing Grid systems by using their computational power as a subordinate value to the overall power of the system. Furthermore, we evaluate the performance of the investigated algorithm extensively, to show how it overcomes the connection stability problem of the mobile devices. Experimental results emphasized that the proposed SRA has a great impact in reducing the total error and link utilization compared with the traditional mechanism.

Download Full-text

Security issues in Mobile Computing

International Journal of Advanced Research in Computer Science and Software Engineering ◽

10.23956/ijarcsse.v8i4.620 ◽

2018 ◽

Vol 8 (4) ◽

pp. 13

Author(s):

Kartik Khurana ◽

Harpreet Kaur ◽

Ritu Chauhan ◽

Shalu Chauhan ◽

Shaveta Bhatia ◽

...

Keyword(s):

Mobile Computing ◽

Mobile Devices ◽

Mobile Communication ◽

Internet Access ◽

Mobile Security ◽

Security Issue ◽

Security Issues

Now a day’s mobile communication has become a serious business tool for the users. Mobile devices are mainly used for the applications like banking, e-commerce, internet access, entertainment, etc. for communication. This has become common for the user to exchange and transfer the data. However people are still facing problems to use mobile devices because of its security issue. This paper deals with various security issues in mobile computing. It also covers all the basic points which are useful in mobile security issues such as categorisation of security issues, methods or tactics for success in security issues in mobile computing, security frameworks.

Download Full-text