• Nuclear Medicine and Molecular Imaging
• /
• v.43 no.5
• /
• pp.443-450
• /
• 2009

Purpose: Conventional image reconstruction uses simplified physical models of projection. However, real physics, for example 3D reconstruction, takes too long time to process all the data in clinic and is unable in a common reconstruction machine because of the large memory for complex physical models. We suggest the realistic distributed memory model of fast-reconstruction using parallel processing on personal computers to enable large-scale technologies. Materials and Methods: The preliminary tests for the possibility on virtual manchines and various performance test on commercial super computer, Tachyon were performed. Expectation maximization algorithm with common 2D projection and realistic 3D line of response were tested. Since the process time was getting slower (max 6 times) after a certain iteration, optimization for compiler was performed to maximize the efficiency of parallelization. Results: Parallel processing of a program on multiple computers was available on Linux with MPICH and NFS. We verified that differences between parallel processed image and single processed image at the same iterations were under the significant digits of floating point number, about 6 bit. Double processors showed good efficiency (1.96 times) of parallel computing. Delay phenomenon was solved by vectorization method using SSE. Conclusion: Through the study, realistic parallel computing system in clinic was established to be able to reconstruct by plenty of memory using the realistic physical models which was impossible to simplify.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.52-62
• /
• 2008

As various types of embedded devices are widely used, a technology that supports reuse of applications on multiple platforms is needed in order for time-to-market development of the applications. The interface middleware is one of such technology and it hides platform dependency from application programmers. Existing interface middleware such as the MT project, Xenomai and Legacy2linux have limitation in that the APIs provided by each of these middleware are fixed to a specific operating system, and the middleware does not provide dynamic expansion of its API set. In this paper, we propose a middleware which hides operating system dependencies and enables porting of applications on various operating systems. In addition, the middleware has scalable structure so that it is suitable for resource-limited embedded systems. The overhead of the middleware, i.e., the time delay occurred by the middleware is between $0.3{\mu}sec\;and\;5{\mu}sec$ in most cases. We believe that the amount of overhead is reasonable and does not hurt the performance of applications.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.758-762
• /
• 2008

Embedded systems usually utilize Flash Memories with very nice characteristics of non-volatility, low access time, low power and so on. For the multimedia database systems, R-tree is an indexing tree with nice characteristics for multimedia access. MR-tree, which is an upgraded version of R-tree, has shown better performance in searching, inserting and deleting operations than R-tree. Flash memory has sectors and blocks as a unit of read, write and delete operations. Especially, the delete is done on a unit of 512 byte blocks with very large operation time and it is also known that read and write operations on a unit of block matches caching nature of MT-tree. Our research optimizes MR-tree operations in a unit of Flash memory blocks. Such an adjusting leads in better indexing performance in database accesses. With MR-tree on a 512B block units we achieved fast search time of database indexing with low height of MR-tree as well as faster update time of database indexing with the best fit of flash memory blocks. Thus MR-tree with optimized operations shows good characteristics to be a database index schemes on any systems with flash memory.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.405-412
• /
• 2006

Real-time operating systems have been used in various computing environments, where a job must be completed in its deadline, with various conditions, such as effective scheduling policies, the minimum of an interrupt delay, and the solutions of priority inversion problems, that should be perfectly satisfied to design and develop optimal real-time operating systems. Up to now, in order to solve priority inversion problems among several those conditions. There have been two representative protocols: basic priority inheritance protocol and priority ceiling emulation protocol. However, these protocols cannot solve complicated priority inversion problems. In this paper, we design a protocol, called recursive priority inheritance (RPI), protocol that effectively solves the complicated priority inversion problems. Our proposed protocol is also implemented in the Linux kernel and is compared with other existing protocols in the aspect of qualitative analysis.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.101-105
• /
• 2008

This paper proposes an analytical model to calculate VoIP (Voice of IP) capacity over wireless LANs with frequent bit errors. Since the traditional analytical models for VoIP capacity have not included the effect of bit errors, simulations ould only evaluate VoIP capacity over erroneous channels. For analytically accurate estimation of VoIP capacity over noisy channels, we extend the conventional model to include the effect of propagation errors, end-to-end delay, voice quality, the waiting time in AP(Access Point). The experiments show that our model predicts the VoIP capacity of a given network within the range from 3% to 9% difference comparing with the simulation results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.63-72
• /
• 2011

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. With the objective of minimizing this wait time, this paper explores the problem of data broadcast over multiple channels. In traditional approaches, data items are partitioned based on their access probabilities and allocated on multiple channels, assuming flat data scheduling per channel. If the data items allocated on the same channel are broadcast in different frequencies based on their access probabilities, the performance will be enhanced further. In this respect, this paper proposes a new broadcast scheduling scheme named two level dynamic programming(TLDP) which can reflect a variation of access probabilities among data items allocated on the same channel.

• Journal of Internet Computing and Services
• /
• v.17 no.5
• /
• pp.1-8
• /
• 2016

This paper proposes a novel broadcast scheduling algorithm for wireless large-scale networks based on theory of complex networks. In the proposed algorithm, the network topology is formed based on a scale-free network and the probability of link distribution is analyzed. In this paper, the characteristics of complex systems are analyzed (which are not concerned by the existing broadcast scheduling algorithm techniques) and the optimization of network transmission efficiency and network time delay are provided.

• KIISE Transactions on Computing Practices
• /
• v.22 no.7
• /
• pp.310-314
• /
• 2016

Currently, several research studies are looking to improve the quality of DASH (Dynamic Adaptive Streaming over HTTP) based live streaming services. However, conventional DASH based streaming schemes cannot provide seamless playback while maintaining the low buffering and it adversely affects the QoE (Quality of Experience). To address this problem, we propose the QoE driven segment scheduling scheme. The proposed scheme adaptively schedules the segment request message according to the time and variation of segment fetching. Simulation results indicate that the proposed scheme improves the QoE of live streaming service by maintaining the low buffering delay and reducing the buffer underflow events.

• Journal of Internet Computing and Services
• /
• v.13 no.1
• /
• pp.15-25
• /
• 2012

Mobile IPv6 (MIPv6) is a host-based protocol supporting global mobility while Proxy Mobile IPv6 (PMIPv6) is a network-based protocol supporting localized mobility. This paper makes its focus on how to reduce the longer delay and extra cost arising from the combination of authentication, authorization and accounting (AAA) and PMIPv6 further. Firstly, a novel authentication scheme (Proxy-AAA) is proposed, which supports fast handover mode and forwarding mode between different local mobility anchors (LMAs). Secondly, a cost analysis model is established based on Proxy-AAA. From the theoretical analysis, it could be noted that the cost is affected by average arrival rate and residence time.

• Journal of Korea Multimedia Society
• /
• v.19 no.11
• /
• pp.1829-1836
• /
• 2016

Today, the application area and scope of FANET(Flying Ad Hoc Network) has been extended. As a result, FANET related research are actively conducted, but there is no decision yet as the routing protocol for FANET. In this paper, we propose the OLSR-Pds (Prediction with direction and speed) which is added a method to predict status of link for OLSR protocol. The mobility of nodes are modeled using Gauss-Markov algorithm, and relative speed between nodes were calculated by derive equation of movement, and thereby we can predict link status. An experiment for comparing AODV, OLSR and, OLSR-Pds was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we were confirm that OLSR-Pds performance are superior in these three factors. OLSR-Pds has the disadvantage that requires time-consuming calculations for link state and required for computing resources, but we were confirm that OLSR-Pds is suitable for routing to the FANET environment because it has all the characteristics of proactive protocol and reactive protocol.