• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.22-32
• /
• 1997

This paper proposes an imprecise compuitation model for DCT considering QOS of images and a two dimensional DCT architecture for imprecise computations. In case that many processes are scheduling in a hard real time system, the system resources are shared among them. Thus all processes can not be allocated enough system resources (such as processing power and communication bandwidth). The imprecise computtion model can be used to provide scheduling flexibility and various QOS(quality of service)levels, to enhance fault tolerance, and to ensure service continuity in rela time systems. The DCT(discrete cosine transform) is known as one of popular image data compression techniques and adopted in JPEG and MPEG algorithms since the DCT can remove the spatial redundancy of 2-D image data efficiently. Even though many commercial data compression VLSI chips include the DCST hardware, the DCT computation is still a very time-consuming process and a lot of hardware resources are required for the DCT implementation. In this paper the DCT procedure is re-analyzed to fit to imprecise computation model. The test image is simulated on teh base of this model, and the computation time and the quality of restored image are studied. The row-column algorithm is used ot fit the proposed imprecise computation DCT which supports pipeline operatiions by pixel unit, various QOS levels and low speed stroage devices. The architecture has reduced I/O bandwidth which could make its implementation feasible in VLSI. The architecture is proved using a VHDL simulator in architecture level.

• The Journal of Natural Sciences
• /
• v.7
• /
• pp.115-120
• /
• 1995

Imprecise computation has been suggested as a promising model of real-time computing in order to deal with timing constraints imposed by the environment. However, the theoretical foundation of the technique has not been fully explored. To address this, a decision-theoretic foundation of imprecise computation is proposed. The main benefit of such a treatment is that it enables the qualitative assumptions underlying imprecise computation techniques to be explicitly stated in a formal way. The theoretical foundation laid out in this paper, hence, will not only enable the justification of using imprecise computation techniques for a real-time application, but will also facilitate the development of extended techniques for more complexs real-time systems.

• The KIPS Transactions:PartA
• /
• v.18A no.4
• /
• pp.143-150
• /
• 2011

This paper presents an EDF based scheduling algorithm for scheduling imprecise computation model where each task consists of mandatory part and optional part. Imprecise computation is useful to manage overload condition. In overload situation, some optional parts should be removed. The proposed DOP algorithm removes optional parts of earlier deadline tasks to enhance flexibly for newly arriving tasks. A simulation result shows that DOP has better performance than other algorithms.

• The Journal of Engineering Research
• /
• v.3 no.1
• /
• pp.117-121
• /
• 1998

This paper describes a model suitable for real-time languages, which explicitly defines a set of resource objects. The resource objects are constituted in a specialization hierarchy which allows programmers to perform resource handling at any desired level of detail, as well as providing a uniform interface. This object-oriented model is used to extend the applicability of the imprecise computation approach to deal with shortfalls of any computational resource, and enable to build real-time systems which can handle dynamic situations.