• ETRI Journal
• /
• v.34 no.3
• /
• pp.330-340
• /
• 2012

In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

• The Journal of Society for e-Business Studies
• /
• v.1 no.1
• /
• pp.227-247
• /
• 1996

Presented in this paper is a control model for developing virtual factory simulator, which is being operated under the distributed environment. The control model consists of production activity plan and information flows. To incorporate elements of the characteristics of the distributed control system, we suggested a collaboration model. This model is working under the client/server architecture, and also designed for cooperative-distributed shop control(CDSC) system in order to exploit several advantages of client/server architecture. Collaboration among each agent(or client) is done through negotiation and task sharing. Based on a contract net model, the CDSC system has three kinds of agents-order agent, resource agent, and communication forwarding agent. Each agent performs shop scheduling and control through negotiation on contract net. No node in CDSC system can have authority over other node. A bidding scheme is employed far negotiation between order agent and resource agents. The CDSC system can support re-negotiation among resource agents and an algorithm for re-negotiation is also developed. Experimental results are shown to advocate the effectiveness of the CDSC system for CIM environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.3
• /
• pp.151-161
• /
• 2014

3GPP LTE-Advanced (Release 10) system specifies carrier aggregation (CA) to enable high data rate on using multiple frequency bands, including the variout CA-specific deployment scenarios. Considering one of those scenarios in which the different directional sector antenna is employed by each frequency band, we propose a per-carrier cell selection scheme that can improve the average throughput of the cell-edge users by allowing each user equipment (UE) to select the frequency band of the adjacent cell. Furthermore, a distributed algorithm for inter-cell copperative scheduling in this scheme is proposed to support proportional fairness among the cells. It has been shown that the proposed scheduling algorithm for the per-carrier cell selection scheme improves the cell-edge user throughput roughly by 50% over that of the conventional scheme.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.510-510
• /
• 1995

• International Journal of Automotive Technology
• /
• v.5 no.4
• /
• pp.269-276
• /
• 2004

There has been considerable activity in recent years in developing timing analysis algorithms for distributed real-time control systems. However, it is difficult for control engineers to analyze the timing behavior of distributed real-time control systems because the algorithms was developed in a software engineer's position and the calculation of the algorithm is very complex. Therefore, there is a need to develop a timing analysis tool, which can handle the calculation complexity of the timing analysis algorithms in order to help control engineers easily analyze or develop the distributed real-time control systems. In this paper, an interactive timing analysis tool, called RAT (Response-time Analysis Tool), is introduced. RAT can perform the schedulability analysis for development of distributed real-time control systems. The schedulability analysis can verify whether all real-time tasks and messages in a system will be completed by their deadlines in the system design phase. Furthermore, from the viewpoint of end-to-end scheduling, RAT can perform the schedulability analysis for series of tasks and messages in a precedence relationship.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.451-456
• /
• 2007

In this paper, we regard computer systems as heterogeneous multi-server systems and propose a cumulative fair scheduling scheme that pursues long-term fairness. GPS(generalized processor sharing)-based scheduling algorithms, which are usually employed in single-server systems, distribute available capacity in an instantaneous manner. However, applying them to heterogeneous multi-server systems may cause unfairness, since they may not prevent the accumulation of scheduling delays and the extra capacities are distributed in an instantaneous manner. In our scheme, long-term fairness is pursued by proper distribution of extra capacities while guaranteeing reserved capacities. A reference capacity model to determine the ideal progresses of applications is derived from long-term observations, and the scheduler makes the applications gradually follow the ideal progresses while guaranteeing their reserved capacities. A heuristic scheduling algorithm is proposed and the scheme is examined by simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.9C
• /
• pp.836-841
• /
• 2002

Packet scheduling is an essential function to guarantee a quality of service by differentiating services in the Internet. Scheduling algorithms that have been suggested so far can be devided into Round-Robin methods and Fair Queueing methods Round-Robin methods have the advantage of high-speed processing through simple implementations, while Fair Queueing methods offer accurate services. Fair queueing algorithms, however, have problems of computational overheads and implementation complexity as their schedulers manage the states of every flow. This paper suggests a new method in which each flow performs the calculation in a distributed way to decide the service order. Our algorithm significantly reduces the scheduler's computational overheads while providing the same level of accuracy with the previous Fair Queueing algorithms.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1521-1529
• /
• 2009

There is a serious unfairness problem between upstream and downstream flows of AP in IEEE 802.11 Wireless LAN. This problem is because Wireless LAN's DCF MAC protocol provides AP with equal channel access priority to mobile noded. Also, it makes this problem worse that the TCP's Data segment loss is more effective on throughput than the TCP's ACK segment. In this paper, we first make several simulations to analysis the unfairness in the various point of view and to find reasons of the unfairness. Also, this paper presents AP's scheduling scheme to alleviate the unfairness problem and evaluate the scheme through ns2 simulator.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.561-565
• /
• 2013

Due to the development of industrial networks, As an alternative to traditional fieldbus, fieldbus networks move to standard Ethernet that high data throughput and scalable technology. Hence we suggest transmission algorithm which satisfied requirements for hard-real time about periodic and aperiodic message based on general-purposed ethernet, and suggest scheduling algorithm for each message.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1125-1134
• /
• 2013

Small cells such as pico or femto cells are promising as a solution to cope with higher traffic explosion and the large number of users. However, the users within small cells are likely to suffer severe inter-cell interference (ICI) from neighboring base stations (BSs). To tackle this, several papers suggest BS transmit power on/off control algorithms which increase edge user throughput. However, these algorithms require centralized coordinator and have high computational complexity. This paper makes a contribution towards presenting fully distributed and low complex joint BS on/off control and user scheduling algorithm (FDA) by selecting on/off pattern of BSs. Throughput the extensive simulations, we verify the performance of our algorithm as follows: (i) Our FDA provides better throughput performance of cell edge users by 170% than the algorithm without the ICI management. (ii) Our FDA catches up with the performance of optimal algorithm by 88-96% in geometric average throughput and sufficiently small gap in edge user throughput.