• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.1
• /
• pp.18-22
• /
• 2010

In real-time embedded systems, the responsibility is the most important thing because it is related to human life. Context switching is a part of which can slow down the responsibility. We therefore should minimize the amount of state that needs to be saved during context switching. In this paper, we introduce a new architecture (Register Farm) for context switching which can exchange two contexts in one cycle time. Although it might increase the cost of MCU design and the complexity of circuit, it cannot miss any interrupt during context switching. Consequently, Register Farm architecture can make embedded systems spread out in human life because it can increase reliability and responsibility in real time embedded systems.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.3
• /
• pp.128-135
• /
• 2010

Recently complexity of embedded software cause to be used real-time operating system (RTOS) to implement various functions in the embedded system. And also, according to requirement of complex functions in embedded systems, the number as well as complexity of tasks get increased continuously. In case that many tasks collaborated in a microprocessor, context switching time between tasks is a overhead waisting a CPU resource. Therefore the time of task context switching is an important factor that affects performance of RTOS. In this paper, we concentrate on the improvement of task context switch for reducing overhead and achieving fast response time in RTOS. To achieve these goal, we suggest multiple register files and task context switching algorithm. By reducing the context switch overhead, we try to ease scheduling and assure fast response times in multitasking environment. As a result, the context switch overhead decreased by 8~16% depend on the number of register files, and some task set which are not schedulable with single register file are schedulable due to that decrease with multiple register files.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.286-288
• /
• 2003

본 논문에서는 real-time환경에서 abnormal task를 자동 검출하여 시스템 overload 및 오 동작을 사전에 검출할 수 있는 방안을 제안한다. 본 논문에서 제안한 방안은 context switching이 발생하는 시점에서 각task들의 cpu 점유율 및 context switching 횟수를 분석하여 비정상적으로 높은 cpu 점유율을 가지는 task와 과도한 context switching을 일으켜 시스템에 overload를 주는 task들을 자동으로 검출한다. 이들 이용하여 신뢰성 있는 real-time시스템 설계 및 구현을 지원할 수 있다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.3
• /
• pp.1380-1386
• /
• 2011

The request of interrupt accompanies a context switching. If the interrupt is frequently requested, this overhead of context switching can reduce seriously the performance of embedded systems. In order to reduce processing overhead due to frequently requested communication interrupts at Asynchronous Serial Communication, this paper introduces the method of Expanded Asynchronous Serial Communication with the Interrupt Coalescence(IC) that accumulates a fixed number of interrupts and processes them in one time. we implement the existing Asynchronous Serial Communication that requests communication interrupts by one byte at an LN2440SBC embedded board with a uC/OS-II and compare interrupt processing time for the performance evaluation about proposed method. As a result, the communication interrupt processing time of proposed method appears in case of low speed(9,600 bps), the decline of an average 25.18% at transmission, the decline of an average 41.47% at reception. and in case of hight speed(115,200 bps), the decline of an average 16.67% at transmission, the decline of an average 25.61% at reception.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.437-442
• /
• 2009

For multiprocessor systems, Earliest Deadline First (EDF) based on deadline and Least Laxity First (LLF) based on laxity are not suitable for practical environment since EDF has low schedulability and LLF has high context switching overhead. As a combining of EDF and LLF to improve the performance, Earliest Deadline Zero Laxity (EDZL) was proposed. EDZL is basically the same as EDF. But if the laxity of a task becomes zero, its priority is promoted to the highest level. In this paper, we propose Least Laxity Zero Laxity (LLZL) which is based on LLF. But context switching is allowed only if the laxity of a task on rady queue becomes zero. Simulation results show that LLZL has high schedulability approaching to LLF and low context switching overhead similar to EDF. In comparison with EDZL, LLZL has better performance in both of schedulability and context switching overhead.

• Journal of Information Technology Applications and Management
• /
• v.17 no.3
• /
• pp.121-134
• /
• 2010

Past studies in e-commerce loyalty were mostly focused on the effects of customer satisfaction and trust on loyalty toward online vendors. Few studies investigated the impacts of switching barriers, whilst they are widely proven to affect customer loyalty in offline commerce. Even in a handful of studies that did deal with switching barriers, their treatment of the subject remained at best superficial. This may have to do with the fact that switching costs in e-commerce could be comparatively negligible, as switching to another online vendor often involves one simple mouse click. In this study, we investigated the impact of switching barriers on loyalty under the e-commerce context. Furthermore, the extent of switching barriers which could be affected by those positive factors (most constructs were adopted from IDT) was also examined. The statistical testing results revealed that combined model which includes both the positive factors and the switching barriers explains the loyalty formation process more strongly ($R^2$ = 0.543) than each separated models ($R^2$ = 0.468 for positive factor only model, and $R^2$ = 0.365 for switching barrier only model). While only the two switching barriers such as convenience and emotional were shown to be statistically significant, we found that trust strongly influences customer's emotional barrier, let alone direct impact on loyalty, which thereby influences loyalty. The results offer insights for better understanding switching barriers in e-commerce related applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4B
• /
• pp.397-402
• /
• 2004

In this paper, we have designed and simulated a new file transmission method. This method restricts memory copy and context switching happened in traditional file transmission. This method shows an improved performance than traditional method in network environment. When the UNIX/LINUX system that uses the existing file transfer technique transmits a packet to the remote system, a memory copy between the user and kernel space occurs over twice at least. Memory copy between the user and kernel space increase a file transmission time and the number of context switching. As a result, the existing file transfer technique has a problem of deteriorating the performance of file transmission. We propose a new algorithm for solving these problems. It doesn't perform memory copy between the user and kernel space. Hence, the number of memory copy and context switching is limited to the minimum. We have modified the network related source code of LINUX kernel 2.6.0 to analyzing the performance of proposed algorithm and implement new network system calls.

• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.377-385
• /
• 2010

To find out an mediating variable between justice perception and switching intentions in the service failure and recovery context the study has centered mainly on justice perceptions, satisfaction and switching intentions after service failure. The researcher found that justice perceptions had negative effects on switching intentions, but satisfaction after service recovery didn't mediate between justice perceptions and switching intentions.

• The Journal of Information Systems
• /
• v.21 no.1
• /
• pp.47-68
• /
• 2012

The purpose of this study is to investigate two components of commitment(affective commitment and calculative commitment) and relational equity on loyalty. In addition, The authors analyzed the moderating effect of length of relationship on the effects of commitments and relational equity on switching intention. Major findings can be summarized as follows. It was found that affective commitment made a negative impact on switching intentions and a positive impact on w-o-m. Calculative commitment had no effect on switching intention and w-o-m while it made a negative effect on w-o-m in handset side only. Relational equity appears to bolster a negative effect on switching intention and a positive effect on w-o-m. Also length of relationship seems to moderate the effect of relational equity on switching intention.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.6
• /
• pp.385-393
• /
• 2017

As the use of mobile devices such as smartphones increases, there is growing interest on the benefits of virtualization in embedded systems. Full virtualization has the advantage of running the guest virtual machine without modifying the guest operating system. However, full virtualization suffers slow execution speed due to the cost of context switching between the virtual machines and the virtual machine monitor. In this paper, we propose a translated block and context switching optimization to improve the guest execution speed in the embedded system. As a result, the improved dynamic binary translator is up to 5.95 times faster than the native execution. Performance degradation is less than that of the other virtualization system.