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

Author(s):  
Hesham A. Ali ◽  
Tamer Ahmed Farrag

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.

2009 ◽  
pp. 3151-3167
Author(s):  
Hesham A. Ali ◽  
Tamer Ahmed Farrag

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.


Author(s):  
V. K. Murthy

This chapter describes an object-based workflow paradigm to support long and short duration transactions in a mobile e-commerce (or m-commerce) environment. In the mobile computing environment, the traditional transaction model needs to be replaced by a more realistic model (called a “workflow model”) between several clients and servers that interact, compete, and cooperate, realising an intergalactic client-server program (ICSP). The various types of task patterns that arise in m-commerce (e-checking, shipping goods, purchasing, and market forecasting) require a subjunctive, or “what-if,” programming approach, consisting of intention and actions for trial-error design, before an actual commitment is made. Eiffel, iContract tool of Java, and UML are powerful languages to implement the intergalactic client-server program (ICSP). They provide for a software contract that captures mutual obligations through program constructs to take care of the unpredictable nature of connectivity of the mobile devices and the networks, as well as the trial and error program design required in m-commerce.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Mingliang Li ◽  
Jianmin Pang ◽  
Feng Yue ◽  
Fudong Liu ◽  
Jun Wang ◽  
...  

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.


2013 ◽  
Vol 9 (1) ◽  
pp. 64-77 ◽  
Author(s):  
Yonggao Yang ◽  
Xusheng Wang ◽  
Lin Li

Mobile computing devices, such as tablets, smartphones, PDAs, and game remote controllers, become very popular in our daily life. This article discusses how to turn these devices, more specifically smartphones and Nintendo Wii remotes (in short as Wiimote), into computer remote controllers. In the smartphone-based system, a smartphone is extended to be the computer’s wireless keyboard and mouse. The smartphone and the computer talk to each other through either wireless Ad Hoc or Wi-Fi access point network. In the Wiimote-based system, a Wiimote is turned into computer’s mouse, where the user moves the mouse cursor by waving the Wiimote in air, and generates mouse events through Wiimote buttons. The Wiimote communicates with the computer through Bluetooth. These systems can be used in conference rooms, classrooms, project seminar rooms, and even people’s living rooms, where a projector screen or a big-screen TV serves as the computer monitor.


Author(s):  
Kartik Khurana ◽  
Harpreet Kaur ◽  
Ritu Chauhan ◽  
Shalu Chauhan ◽  
Shaveta Bhatia ◽  
...  

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.


1993 ◽  
Author(s):  
M. Satyanarayanan ◽  
James J. Kistler ◽  
Lily B. Mummert ◽  
Maria R. Ebling ◽  
Puneet Kumar

Sign in / Sign up

Export Citation Format

Share Document