A scheduling algorithm with dynamic properties in mobile grid

2014 ◽  
Vol 8 (5) ◽  
pp. 847-857 ◽  
Author(s):  
JongHyuk Lee ◽  
SungJin Choi ◽  
JoonMin Gil ◽  
Taeweon Suh ◽  
HeonChang Yu
Keyword(s):  
Dynamic Properties ◽  
Scheduling Algorithm ◽  
Mobile Grid

Balanced Scheduling Algorithm Considering Availability in Mobile Grid

2009 ◽  
pp. 211-222 ◽  
Author(s):  
JongHyuk Lee ◽  
SungJin Song ◽  
JoonMin Gil ◽  
KwangSik Chung ◽  
Taeweon Suh ◽  
...  
Keyword(s):  
Scheduling Algorithm ◽  
Mobile Grid

Mobility-aware balanced scheduling algorithm in mobile Grid based on mobile agent

2014 ◽  
Vol 29 (4) ◽  
pp. 409-432 ◽  
Author(s):  
Jonghyuk Lee ◽  
Sungjin Choi ◽  
Taeweon Suh ◽  
Heonchang Yu
Keyword(s):  
Load Balancing ◽  
Mobile Devices ◽  
Scheduling Algorithm ◽  
Superior Performance ◽  
Battery Life ◽  
Location Awareness ◽  
Message Delivery ◽  
Mobile Grid ◽  
Fixed Grid ◽  
Grid Resources

AbstractThe emerging Grid is extending the scope of resources to mobile devices and sensors that are connected through loosely connected networks. Nowadays, the number of mobile device users is increasing dramatically and the mobile devices provide various capabilities such as location awareness that are not normally incorporated in fixed Grid resources. Nevertheless, mobile devices exhibit inferior characteristics such as poor performance, limited battery life, and unreliable communication, compared with fixed Grid resources. Especially, the intermittent disconnection from network owing to users’ movements adversely affects performance, and this characteristic makes it inefficient and troublesome to adopt the synchronous message delivery in mobile Grid. This paper presents a mobile Grid system architecture based on mobile agents that support the location management and the asynchronous message delivery in a multi-domain proxy environment. We propose a novel balanced scheduling algorithm that takes users’ mobility into account in scheduling. We analyzed users mobility patterns to quantitatively measure the resource availability, which is classified into three types: full availability, partial availability, and unavailability. We also propose an adaptive load-balancing technique by classifying mobile devices into nine groups depending on availability and by utilizing adaptability based on the multi-level feedback queue to handle the job type change. The experimental results show that our scheduling algorithm provides a superior performance in terms of execution times to the one without considering mobility and adaptive load-balancing.

scholarly journals Energy Efficient Resource Management in Mobile Grid

2010 ◽  
Vol 6 (2) ◽  
pp. 193-211 ◽  
Author(s):  
Chunlin Li ◽  
Layuan Li
Keyword(s):  
Resource Management ◽  
Energy Efficient ◽  
Optimization Problem ◽  
Scheduling Algorithm ◽  
Optimization Theory ◽  
Research Area ◽  
Energy Aware ◽  
Mobile Grid ◽  
Management Algorithm ◽  
Efficient Resource

Energy efficient computing has recently become hot research area. Many works have been carried out on conserving energy, but considering energy efficiency in grid computing is few. This paper proposes energy efficient resource management in mobile grid. The objective of energy efficient resource management in mobile grid is to maximize the utility of the mobile grid which is denoted as the sum of grid application utility. The utility function models benefits of application and system. By using nonlinear optimization theory, energy efficient resource management in mobile grid can be formulated as multi objective optimization problem. In order to derive a distributed algorithm to solve global optimization problem in mobile grid, we decompose the problem into the sub problems. The proposed energy efficient resource management algorithm decomposes the optimization problem via iterative method. To test the performance of the proposed algorithm, the simulations are conducted to compare proposed energy efficient resource management algorithm with other energy aware scheduling algorithm.

A Mobile Device Group Based Fault Tolerance Scheduling Algorithm in Mobile Grid

2012 ◽  
pp. 485-492 ◽  
Author(s):  
JongHyuk Lee ◽  
SungJin Choi ◽  
Taeweon Suh ◽  
JoonMin Gil ◽  
Weidong Shi ◽  
...  
Keyword(s):  
Fault Tolerance ◽  
Mobile Device ◽  
Scheduling Algorithm ◽  
Mobile Grid

scholarly journals Heuristic Scheduling Algorithm Oriented Dynamic Tasks for Imaging Satellites

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Maocai Wang ◽  
Guangming Dai ◽  
Massimiliano Vasile
Keyword(s):  
Heuristic Algorithms ◽  
Time Window ◽  
Dynamic Properties ◽  
Scheduling Algorithm ◽  
Point Of View ◽  
Algorithm Performance ◽  
Heuristic Scheduling ◽  
Np Hard Problem ◽  
Complex Constraints ◽  
Satellite Scheduling

Imaging satellite scheduling is an NP-hard problem with many complex constraints. This paper researches the scheduling problem for dynamic tasks oriented to some emergency cases. After the dynamic properties of satellite scheduling were analyzed, the optimization model is proposed in this paper. Based on the model, two heuristic algorithms are proposed to solve the problem. The first heuristic algorithm arranges new tasks by inserting or deleting them, then inserting them repeatedly according to the priority from low to high, which is named IDI algorithm. The second one called ISDR adopts four steps: insert directly, insert by shifting, insert by deleting, and reinsert the tasks deleted. Moreover, two heuristic factors, congestion degree of a time window and the overlapping degree of a task, are employed to improve the algorithm’s performance. Finally, a case is given to test the algorithms. The results show that the IDI algorithm is better than ISDR from the running time point of view while ISDR algorithm with heuristic factors is more effective with regard to algorithm performance. Moreover, the results also show that our method has good performance for the larger size of the dynamic tasks in comparison with the other two methods.

The distribution of antigen on the surface of RBL-2H3 rat basophilic leukemia cells observed by back-scattered electron imaging

1986 ◽  
Vol 44 ◽  
pp. 274-275
Author(s):  
R.F. Stump ◽  
J.R. Pfeiffer ◽  
JC. Seagrave ◽  
D. Huskisson ◽  
J.M. Oliver
Keyword(s):  
Cell Surface ◽  
Dynamic Properties ◽  
Leukemia Cells ◽  
Antigen Binding ◽  
Scattered Electron ◽  
Ige Receptor ◽  
Receptor Complexes ◽  
Rat Basophilic Leukemia Cells ◽  
Electron Imaging ◽  
Basophilic Leukemia

In RBL-2H3 rat basophilic leukemia cells, antigen binding to cell surface IgE-receptor complexes stimulates the release of inflammatory mediators and initiates a series of membrane and cytoskeletal events including a transformation of the cell surface from a microvillous to a lamellar topography. It is likely that dynamic properties of the IgE receptor contribute to the activation of these responses. Fewtrell and Metzger have established that limited crosslinking of IgE-receptor complexes is essential to trigger secretion. In addition, Baird and colleagues have reported that antigen binding causes a rapid immobilization of IgE-receptor complexes, and we have demonstrated an apparent increase with time in the affinity of IgE-receptor complexes for antigen.

Nucleosome dynamics

2006 ◽  
Vol 73 ◽  
pp. 109-119 ◽  
Author(s):  
Chris Stockdale ◽  
Michael Bruno ◽  
Helder Ferreira ◽  
Elisa Garcia-Wilson ◽  
Nicola Wiechens ◽  
...  
Keyword(s):  
High Resolution ◽  
Chromatin Structure ◽  
Current Knowledge ◽  
Dynamic Properties ◽  
Structure And Dynamics ◽  
Nucleosome Dynamics ◽  
Sharp Focus ◽  
Recent Advances ◽  
Insight Into ◽  
Chromatin Structure And Dynamics

In the 30 years since the discovery of the nucleosome, our picture of it has come into sharp focus. The recent high-resolution structures have provided a wealth of insight into the function of the nucleosome, but they are inherently static. Our current knowledge of how nucleosomes can be reconfigured dynamically is at a much earlier stage. Here, recent advances in the understanding of chromatin structure and dynamics are highlighted. The ways in which different modes of nucleosome reconfiguration are likely to influence each other are discussed, and some of the factors likely to regulate the dynamic properties of nucleosomes are considered.

Sign in / Sign up

Export Citation Format

Share Document