• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.511-518
• /
• 2002

Symmetric Multiprocessors (SMP) has emerged as an important and cost-effective platform for high performance parallel computing. Scheduling of parallel tasks and communications of SMP is important because the choice of a scheduling discipline can have a significant impact on the performance of the system. In this paper, we present a task duplication based scheduling scheme for bus-based SMP. The proposed scheme pre-allocates network communication resources so as to avoid potential communication conflicts. The performance of the proposed scheme has been observed by comparing the schedule length under various number of processors and the communication cost.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.216-217
• /
• 2015

Duty-cycling could efficiently prolong the life time of Wireless Sensor Networks (WSNs) by let nodes be in dormant state most of the time, and only wake up (for sending or receiving) for a very short period. Flooding is one critical operation of WSNs. Many studies have been studied to improve the delay and/or energy efficiency of flooding. In this paper, we propose a novel time slot design, and the switching decision that reduce energy consumption for the schedule-based flooding tree. Each node, if failed to receive from its parent, will look for other candidate, among its siblings to overhear the flooding packet. By accurately collect information from other siblings, each node can make the best as possible switching decision; therefore the energy efficiency of the network is improved.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.175-185
• /
• 2005

The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.153-161
• /
• 2009

In this paper, we designed and implemented realtime DID(digital information display) system based on web server that displayed multimedia contents. The contents are weather, news information on the internet web sites and public relations or advertisements data on local systems. The DID system has client/server architecture that the server send to client that schedule informations and multimedia contents received form web server and the client displayed the contents though scheduled information. Therefore the systems overcome network fault for the mean time. Also, the system has realtime services of web page filtering function that extract the partial information of specific web pages.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.413-416
• /
• 2008

In the presence of multiple continuous queries, multi-query optimizing is a new challenge to process multiple stream data in real-time. So, in this paper, we proposed an approach to optimize multi-query of sliding window on network traffic data streams and do some comparisons to traditional queries without optimizing. We also detail some method of scheduling on different data streams, while different scheduling made different results. We test the results on variety of multi-query processing schedule, and proofed the proposed method is effectively optimized the data stream similar multi-queries.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.141-150
• /
• 2012

This paper suggests a critical path search algorithm that can easily draw PERT/GANTT chart which manages and plans a project schedule. In order to evaluate a critical path that determines the project schedule, Critical Path Method (CPM) is generally utilized. However, CPM undergoes 5 stages to calculate the critical path for a network diagram that is previously designed according to correlative relationship and execution period of project execution activities. And it may not correctly evaluate $T_E$ (The Earliest Time), since it does not suggest the way how to determine the sequence of the nodes activities that calculate the $T_E$. Also, the sequence of the network diagram activities obtained from CPM cannot be visually represented, and hence Lucko suggested an algorithm which undergoes 9 stages. On the other hand, the suggested algorithm, first of all, decides the sequence in advance, by reallocating the nodes into levels after Breadth-First Search of the network diagram that is previously designed. Next, it randomly chooses nodes of each level and immediately determines the critical path only after calculation of $T_E$. Finally, it enables the representation of the execution sequence of the project activity to be seen precisely visual by means of a small movement of $T_E$ of the nodes that are not belonging to the critical path, on basis of the $T_E$ of the nodes which belong to the critical path. The suggested algorithm has been proved its applicability to 10 real project data. It is able to get the critical path from all the projects, and precisely and visually represented the execution sequence of the activities. Also, this has advantages of, firstly, reducing 5 stages of CPM into 1, simplifying Lucko's 9 stages into 2 stages that are used to clearly express the execution sequence of the activities, and directly converting the representation into PERT/GANTT chart.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.846-850
• /
• 2009

Recently, wireless sensor networks have found their way into a wide variety of applications and systems with vastly varying requirements and characteristics such as environmental monitoring, smart spaces, medical applications, and precision agriculture. The sensor nodes are battery powered. Therefore, the energy is the most precious resource of a wireless sensor network since periodically replacing the battery of the nodes in large scale deployments is infeasible. Energy efficient mechanisms for gathering sensor readings are indispensable to prolong the lifetime of a sensor network as long as possible. There are two energy-efficient approaches to prolong the network lifetime in sensor networks. One is the compression scheme to reduce the size of sensor readings. When the communication conflict is occurred between two sensor nodes, the sender must try to retransmit its reading. The other is the MAC protocol to prevent the communication conflict. In this paper, we propose a novel approaches to reduce the size of the sensor readings in the MAC layer. The proposed scheme compresses sensor readings by allocating the time slots of the TDMA schedule to them dynamically. We also present a mathematical model to predict latency from collecting the sensor readings as the compression ratio is changed. In the simulation result, our proposed scheme reduces the communication cost by about 52% over the existing scheme.

• The Journal of the Korea Contents Association
• /
• v.10 no.8
• /
• pp.51-58
• /
• 2010

In data collection using a mobile sink, the time that sensor nodes are included in its communication radius is not uniform. The data collection schedule in non-uniform time is needed between a mobile sink and sensor nodes for efficient data collection. The existing data collection schemes using a mobile sink considered staying time in its communication range and data collected by the mobile sink. However, they did not consider the characteristics of data collected in sensor networks. In this paper, we propose a TDMA based schedule scheme that consists of the data collection period by each sensor nodes and the data collection period between a mobile sink and sensor nodes. Moreover, we propose a data collection scheme considering the variability of data in sensor networks. The proposed data collection scheme collects only data that changed larger than the threshold set by the user. In order to show the superiority of the proposed scheme, we compare it with DWEDF that aims to collect data uniformly. As a result, our experimental results show that the proposed scheme reduces about 23% energy consumption and the data collection failure of sensor nodes over the DWEDF.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.115-121
• /
• 2015

In this paper, we proposed an iterative data-flow optimal scheduling algorithm based on genetic algorithm for high-performance multiprocessor. The basic hardware model can be extended to include detailed features of the multiprocessor architecture. This is illustrated by implementing a hardware model that requires routing the data transfers over a communication network with a limited capacity. The scheduling method consists of three layers. In the top layer a genetic algorithm takes care of the optimization. It generates different permutations of operations, that are passed on to the middle layer. The global scheduling makes the main scheduling decisions based on a permutation of operations. Details of the hardware model are not considered in this layer. This is done in the bottom layer by the black-box scheduling. It completes the scheduling of an operation and ensures that the detailed hardware model is obeyed. Both scheduling method can insert cycles in the schedule to ensure that a valid schedule is always found quickly. In order to test the performance of the scheduling method, the results of benchmark of the five filters show that the scheduling method is able to find good quality schedules in reasonable time.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.4D
• /
• pp.679-686
• /
• 2006

Recently, the city railway in the Seoul Metropolitan Area (SMA) has offered a low quality of service as a passage time, because it was operated slowly. So, the people who live in modern society are not satisfied about passage time, therefore, this study tried to make that the subway in the SMA becomes a more functional and effective wide-area-transportation-network through an express train introduction's method which examined cases from abroad and current system. and then presented how express train could be applied to current system. In a case study, We used the An-San Line and Su-In Line as a examples and developed a schedule which can minimize the delaying time of subway by using Branch & Bound Algorithm. The train operational plan was loaded to consider a railroad siding, Obtained site, and the dispatch interval(three to ten minutes) for the express and local lines and finally, We presented an alternative operational plan which made by those factors.