Software-as-a-Service using Heterogeneous Distributed System for User Specific Applications

2014 ◽  
Vol 4 (1) ◽  
pp. 15-32 ◽  
Author(s):  
Anirban Kundu ◽  
Chunlin Ji ◽  
Ruopeng Liu
Keyword(s):  
Dynamic Scheduling ◽  
Cost Minimization ◽  
System Structure ◽  
Main Concern ◽  
Distributed Environment ◽  
Time Dynamic ◽  
Server Side ◽  
Dedicated Servers ◽  
Background Mode ◽  
Cost Feasibility

In this paper, major goal is to achieve distributed environment configuring heterogeneous system framework using existing machines and high-end workstations as servers without involving extra cost. Feasibility of proposed system network is main concern in this paper having cost minimization. Data replication is responsible for enhancing dynamic scheduling in run-time. Dynamic scheduling is going to be exploited determining possible sub-network and related servers for specific user targeted tasks using active status and busy status of servers. Server-side background mode of operation is to be conducted for accessing dedicated or non-dedicated servers. Minimization of time and maximization of speed are objectives of proposed system structure.

Data Specific Ranking in Cloud

2014 ◽  
Vol 4 (4) ◽  
pp. 32-41 ◽  
Author(s):  
Anirban Kundu ◽  
Guanxiong Xu ◽  
Chunlin Ji
Keyword(s):  
Dynamic Scheduling ◽  
System Structure ◽  
Distributed Network ◽  
Major Goal ◽  
Data Redundancy ◽  
Time Dynamic ◽  
Run Time

In this paper, the major goal is to achieve searching in distributed network with proper ranking. Heterogeneous framework is going to be utilized using existing machines and high-end workstations. Data redundancy is responsible for enhancing dynamic scheduling in run-time. Dynamic scheduling is going to be exploited determining possible sub-network and related servers for specific user targeted tasks using active and busy ranking status of servers. Minimization of time and maximization of speed are objectives of proposed system structure.

Dynamic Scheduling Model of Rail-Guided Vehicle (RGV) Based on Genetic Algorithms in the Context of Mobile Computing

2021 ◽  
Vol 12 (1) ◽  
pp. 43-62
Author(s):  
Chen Xu ◽  
Xueyan Xiong ◽  
Qianyi Du ◽  
Shudong Liu ◽  
Yipeng Li ◽  
...  
Keyword(s):  
Information System ◽  
Mobile Computing ◽  
Dynamic Scheduling ◽  
Distributed Processing ◽  
Processing System ◽  
Time Dynamic ◽  
Scheduling Model ◽  
Practical Operation ◽  
Optimization Efficiency ◽  
Production And Operation

Track guidance vehicle (RGV) is widely used in logistics warehousing and intelligent workshop, and its scheduling effectiveness will directly affect the production and operation efficiency of enterprises. In practical operation, central information system often lacks flexibility and timeliness. By contrast, mobile computing can balance the central information system and the distributed processing system, so that useful, accurate, and timely information can be provided to RGV. In order to optimize the RGV scheduling problem in uncertain environment, a genetic algorithm scheduling rule (GAM) using greedy algorithm as the genetic screening criterion is proposed in this paper. In the experiment, RGV scheduling of two-step processing in an intelligent workshop is selected as the research object. The experimental results show that the GAM model can carry out real-time dynamic programming, and the optimization efficiency is remarkable before a certain threshold.

Dynamic scheduling of production-assembly networks in a distributed environment

2007 ◽  
Vol 39 (4) ◽  
pp. 395-409 ◽  
Author(s):  
Michael Masin ◽  
Melike Oz Pasaogullari ◽  
Sanjay Joshi
Keyword(s):  
Dynamic Scheduling ◽  
Distributed Environment

Research and Design of Smart Phone-Based Logistics Information Management System

2011 ◽  
Vol 403-408 ◽  
pp. 2469-2472
Author(s):  
Wei Dong Huang ◽  
Ran Ni ◽  
Shi Ying Shi
Keyword(s):  
Information Management ◽  
Information Exchange ◽  
Management System ◽  
Smart Phone ◽  
Information Management System ◽  
Basic Function ◽  
System Structure ◽  
Server Side ◽  
Network Connection ◽  
Logistics Information

With the continuous development and improvement of wireless communication technology, the logistics information management system based on PC limits the timeliness of information exchange in the logistics business process. The java-based J2ME mobile phone as a wireless terminal device with the convenience of carry; therefore the J2ME technology in the construction of logistics information is a new way of thinking. This paper first makes an overall design of mobile logistics information management system structure, analyzes the basic function of this system, researches the network connection between client and server and realizes the server-side functionality design. Finally, the article concluded that the J2ME technology can be widely used in mobile management system, and the logistic information management system based on J2ME can greatly improve the working efficiency of the logistics enterprise.

scholarly journals A Practical Infrastructure for Real-Time Simulation across Timing Domains

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Yao-fei Ma ◽  
Xiao Song ◽  
Jiang-yun Wang ◽  
Zhen Xiao
Keyword(s):  
Real Time ◽  
Data Transmission ◽  
Distribution System ◽  
Continuous System ◽  
System Structure ◽  
Distributed Environment ◽  
Real Time Simulation ◽  
Time Simulation ◽  
External Time ◽  
Computation Load

A real-time infrastructure, called MLRTI, is proposed in this paper to fulfill the requirement of real-time simulation in distributed environment. There are two novel contributions in this work. Firstly, a flexible timing mechanism is proposed to integrate external time source and local timer utility, enabling the distributed nodes to advance their timeline simultaneously at different speeds with high precision. A data transmission solution is also presented in which the reflective memory card (VMIC) is employed to provide fast data transmission with minimum delay. Secondly, a system partition schema is proposed in MLRTI to reduce the solution errors introduced by transforming a continuous system into distribution system, which is common in a class of control applications where the system is designed in centralized model but simulated in distributed environment for constrains on system structure or the need to balance computation load. Experiments are conducted and the results show this schema effectively reduces the possible errors by properly partitioning the system into parts that are suitable to be deployed in distributed environment.

Further results for dynamic scheduling of multiclass G/G/1 queues

1989 ◽  
Vol 26 (3) ◽  
pp. 595-603 ◽  
Author(s):  
Tetsuji Hirayama ◽  
Masaaki Kijima ◽  
Shoichi Nishimura
Keyword(s):  
Discrete Time ◽  
Dynamic Scheduling ◽  
Finite Horizon ◽  
Service Discipline ◽  
Scheduling Problems ◽  
Time Dynamic ◽  
Simple Index ◽  
Preemptive Resume ◽  
Index Policies ◽  
Holding Cost

We consider discrete-time dynamic scheduling problems of the following three types of G/G/1 queue with K different customer classes: (i) a G/DFR/1 queue with K classes under preemptive resume service discipline, (ii) a G/IFR/1 queue with two classes under preemptive resume service discipline, and (iii) a G/G/1 queue with two classes under non-preemptive service discipline. Interchange arguments are used to show that simple index policies of different type minimize the total holding cost of customers in a finite-horizon scheduling period for the three cases. Our results extend the result for a G/M/1 queue by Buyukkoc et al. (1985) to general queues.

Sign in / Sign up

Export Citation Format

Share Document