• Journal of the Korea Institute of Building Construction
• /
• v.13 no.6
• /
• pp.565-578
• /
• 2013

Batch production is common in repetitive construction projects, and it is not unusual for different batch sizes to be used by contractors in one project. While several scheduling methods, such as the Linear Scheduling Method (LSM) and the Repetitive Scheduling Method (RSM) have been proposed and used, no mathematical method for repetitive construction projects has been developed, and it is difficult to consider different batch sizes with the existing methods. An original mathematical algorithm for scheduling repetitive projects with different batch sizes is proposed in this study. This algorithm is illustrated with assumptions of resource continuity and single path in a project and introduces new terms, control batch and critical batch. The algorithm logics and mathematical equations are validated by comparison with the outcomes from a graphical scheduling approach through a simple and practical hypothetic project. As a result, it is expected that the proposed algorithm can be easily adapted and extended to computer software for scheduling, and can be a starting point for research on batch size management in repetitive construction projects.

• ETRI Journal
• /
• v.27 no.5
• /
• pp.533-538
• /
• 2005

We developed a pipelined scheduling technique of functional hardware and software modules for platform-based system-on-a-chip (SoC) designs. It is based on a modified list scheduling algorithm. We used the pipelined scheduling technique for a performance analysis of an MPEG4 video encoder application. Then, we applied it for architecture exploration to achieve a better performance. In our experiments, the modified SoC platform with 6 pipelines for the 32-bit dual layer architecture shows a 118% improvement in performance compared to the given basic SoC platform with 4 pipelines for the 16-bit single-layer architecture.

• Journal of the Korean Society for Railway
• /
• v.9 no.1 s.32
• /
• pp.50-56
• /
• 2006

This paper presents a mathematical model of the long-term track tamping scheduling problem in the Korean highspeed railway system. The presented model encompasses various operational field constraints, moreover improves a state-of-the-art model in extending the feasible space. We show the model is sized up to intractable scale, then propose another approximation model that is possible to handle with the present computer system and commercial optimization package, directly. The aggregated index, lot, is selected, considering the resolution of the planning horizon as well as scheduling purpose. Lastly, this paper presents two test results for the approximation model. The results expose the approximation model to quite promising in deploying it into an operational software program for the long-term track tamping scheduling problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.39-60
• /
• 2017

In the Cloud, for the scheduling of parallel jobs, there are many tasks in a job and those tasks are executed concurrently on different VMs (Visual machines), where each task of the job will be executed synchronously. The goal of scheduling is to reduce the execution time and to keep the fairness between jobs to prevent some jobs from waiting more time than others. We propose a Cloud model which has multiple Clouds, and under this model, jobs are in different lists according to the waiting time of the jobs and every job has different parallelism. At the same time, a new method-ZOMT (the scheduling parallel tasks based on ZERO-ONE scheduling with multiple targets) is proposed to solve the problem of scheduling parallel jobs in the Cloud. Simulations of ZOMT, AFCFS (Adapted First Come First Served), LJFS (Largest Job First Served) and Fair are executed to test the performance of those methods. Metrics about the waiting time, and response time are used to test the performance of ZOMT. The simulation results have shown that ZOMT not only reduces waiting time and response time, but also provides fairness to jobs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.351-356
• /
• 2015

Synthetic utilization on multiprocessor system is not considered periodic tasks, except scheduling methods for aperiodic tasks where one of the real-time aperiodic tasks is a scheduling method. But really aperiodic tasks scheduling method is composed of mixed task types. Aperiodic task scheduling method guarantee an analysis of the schedualibility of aperiodic task. The set of mixed tasks periodic and aperiodic tasks scheduling method uses improved synthetic utilization that is presented in this paper. The new method shows that schedulability increases aperiodic server method.

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

Most partitioning algorithms for hardware- software codesign do not consider scheduling. Therefore, partitioning should be performed again if time constraints art not satisfied in scheduling the partitioned results. Existing FDS-applied methods which consider scheduling in partitioning decide the control step of the node to schedule while selecting nodes for partitioning. In selecting nodes for partitioning, several aspects should be considered together such as added cost or time due to the partition of the node, or the degree of interference due to the scheduling of the node. At this time, the induced force, which means the degree of intereference of scheduling other nodes, is computed all over the control step of the corresponding node and other depending nodes. In this paper, a new FDS-applied partitioning algorithm is proposed, where partitioning is performed using the defined scheduling urgency and relative scheduling urgency of the nodes. Since the nodes are partitioned by the computation of relative scheduling urgencies only at the earliest control step and the latest control step among the assignable steps, the time complexity for the computation of induced force could be improve. Experimental result on the benchmarks show the improvement of execution time of the proposed algorithm compared to the existing FDS-applied methods.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.241-241
• /
• 2002

MSC(Multi-Spectral Camera) is a main payload of KOMPSAT(Korea Multi-Purpose Satellite)-II which will be launched in 2004. MSC will perform his mission with the GSD(Ground Sample Distance) of 1m, swath width of 15km and spectral range of 450nm~900nm at the altitude of 685km. MSC consists of three main subsystems. One is EOS(Electro-Optics Subsystem), another is PMU(Payload Management Unit) and the other is PDTS(Payload Data Transmission Subsystem). There is an SBC(Single Board Computer) in the PW to control all the other units and SBC software performs the interface with spacecraft and control all MSC sub-units. SBC software consists of a lot of tasks and manages them with the time criticalness. All tasks are designed to be scheduled and executed at the predetermined time in order to make sure that the mission of MSC system is achieved successfully. In this paper, the real-time task scheduling of the SBC software will be described and analyzed.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.371-375
• /
• 2007

In this paper, we have implemented the device management system to upgrade T-PAK software in mobile phone. The hybrid scheduling method and selective upgrade method are proposed. Hybrid scheduling method is based on distribution of delivery data in accordance with network traffic load and service priority from device management server to mobile phone. Selective upgrade method manages DSL classified by T-PAK software version to be upgrade using version management established in OMA DM SCOMO. Key mechanism of selective upgrade method is to only deliver DSL to be replaced to the mobile phone. We made an experiment on two methods using MS-700T terminals. The experimental result shows that the proposed method is faster than normal from delivery time standpoint.

• Proceedings of the KSRS Conference
• /
• v.1
• /
• pp.196-199
• /
• 2006

Various communication mechanisms have been developed to acquire a meaningful data from sensors. The key requirement during the sensor data acquisition is determinism and reduction of time dependency. It is a fundermental level of satellite data management for controlling satellite operation software data acquisition from sensors or subsystem. Satellite operation software has various software modules to be operated in addition to data acquisition. Therefore, unnecessary time delay shall be minimized to perform the data acquisition. As the result, interrupt method might be prefered than polling method because the former can decrease the restriction of design during implementation of data acquisition logic. The possible problems while using interrupt method like as interrupt latency caused by delaying of interrupt processing time are analyzed. In this paper, communication mechanism which can be used to interface with satellite computer and subsidary subsystem by using interrupt is presented. As well, time dependency between software scheduling and data acquisition is analyzed.

• ETRI Journal
• /
• v.32 no.5
• /
• pp.657-664
• /
• 2010

Many embedded multimedia systems employ special hardware blocks to co-process with the main processor. Even though an efficient handling of such hardware blocks is critical on the overall performance of real-time multimedia systems, traditional real-time scheduling techniques cannot afford to guarantee a high quality of multimedia playbacks with neither delay nor jerking. This paper presents a hardware-aware rate monotonic scheduling (HA-RMS) algorithm to manage hardware tasks efficiently and handle special hardware blocks in the embedded multimedia system. The HA-RMS prioritizes the hardware tasks over software tasks not only to increase the hardware utilization of the system but also to reduce the output jitter of multimedia applications, which results in reducing the overall response time.