KR900000766A - How to create a task by table - Google Patents

How to create a task by table Download PDF

Info

Publication number
KR900000766A
KR900000766A KR1019880007919A KR880007919A KR900000766A KR 900000766 A KR900000766 A KR 900000766A KR 1019880007919 A KR1019880007919 A KR 1019880007919A KR 880007919 A KR880007919 A KR 880007919A KR 900000766 A KR900000766 A KR 900000766A
Authority
KR
South Korea
Prior art keywords
event
task
information
output
link
Prior art date
Application number
KR1019880007919A
Other languages
Korean (ko)
Inventor
백성욱
Original Assignee
최근선
주식회사 금성사
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 최근선, 주식회사 금성사 filed Critical 최근선
Priority to KR1019880007919A priority Critical patent/KR900000766A/en
Publication of KR900000766A publication Critical patent/KR900000766A/en

Links

Landscapes

  • Debugging And Monitoring (AREA)

Abstract

내용 없음No content

Description

테이블에 의한 타스크(Task)작성방법How to create a task by table

본 내용은 요부공개 건이므로 전문내용을 수록하지 않았음Since this is an open matter, no full text was included.

제1도는 본 발명의 컴퓨터의 타스크 제어장치 블록도,1 is a block diagram of a task controller of the computer of the present invention,

제2도는 본 발명의 테이블에 의한 타스크 작성방법의 신호.2 is a signal of a task creation method using a table of the present invention.

Claims (1)

한 타스크를 수행시 타스크의 메인모듈(1)의 메인루틴에서 초기처리를 한 후 입출력에서 사건이 발생되었는지를 판별하여 발생되었을 경우 입출력장치 구동루틴에서는 레이블의 해당비트를 세트시켜 메인모듈(1)에 인식시키고, 이에따라 메인모듈(1)은 입출력에서 발생된 사건정보데이타를 버퍼에 저장시킨후 테이블 호출루틴(2)에서 상기 사건데이타 아이템 넘버의 키값에 의해 링크레이블맵(3)을 서치한 후 그 서치 정보가 있는 지를 판별하여 있을 경우에는 링크레이블맵(3)에서 해당 링크모듈(41-4n)을 호출하고, 그 호출한 해당 링크모듈(41-4n)에서 발생된 사건정보데이타를 처리한 후 그 처리한 데이타가 오류인지를 판별하여 오류가 아닐 경우에는 입출력에서 사건이 발생되었는지를 상기와 같이 반복 판별 수행하고, 상기 처리한 데이타가 오류일 경우에는 상기에서 서치정보가 없을 경우와 동일하게 표시부에 에러메시지를 표시한 후 입출력에서 사건발생 여부에 따라 반복수행함을 특징으로 하는 테이블에 의한 타스크(Task) 작성방법.When performing a task, after initial processing is performed in the main routine of the main module (1) of the task to determine whether an event has occurred in I / O. Then, the main module 1 stores the event information data generated at the input / output in the buffer and searches the link label map 3 by the key value of the event data item number in the table call routine 2. If you have to determine whether there is information that the search has been called the link module (4 1 -4 n) in the link label map (3), occurs in the call that the link module (4 1 -4 n) information events After the data has been processed, it is determined whether the processed data is an error, and if it is not an error, it is repeatedly determined whether an event has occurred in the input / output as described above. There after displaying an error message on the same display unit as the absence from the search information the tasks (Task) creation method according to the table, characterized by repeatedly carrying out depending on whether the event occurs in the output when the. ※ 참고사항 : 최초출원 내용에 의하여 공개하는 것임.※ Note: The disclosure is based on the initial application.
KR1019880007919A 1988-06-29 1988-06-29 How to create a task by table KR900000766A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1019880007919A KR900000766A (en) 1988-06-29 1988-06-29 How to create a task by table

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1019880007919A KR900000766A (en) 1988-06-29 1988-06-29 How to create a task by table

Publications (1)

Publication Number Publication Date
KR900000766A true KR900000766A (en) 1990-01-31

Family

ID=68233771

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1019880007919A KR900000766A (en) 1988-06-29 1988-06-29 How to create a task by table

Country Status (1)

Country Link
KR (1) KR900000766A (en)

Similar Documents

Publication Publication Date Title
SE7708209L (en) INFORMATION PROCESSING PLANT
KR960032172A (en) Computer systems
KR890702125A (en) Information processing system
KR920001323A (en) How processors work to improve computer performance by removing branches
KR900000766A (en) How to create a task by table
KR920022145A (en) Computer graphics system for representing an object and method for displaying the object on a computer graphics system
JPH0233661A (en) Character processor containing automatic address input function
KR930009784A (en) Hand Print Acceleration Recognition System and Method
JPH01237724A (en) Method for retrieving and displaying ambiguous character string
KR910005150A (en) Calculator and the calculation method used in this calculator
KR900002602A (en) LED Driving Method in Digital Telephone
KR920006863A (en) How Your Data Is Processed
KR930002112A (en) How to perform calculation function using typewriter
KR970002683A (en) Data processing method for screen control received in serial communication
KR920002353A (en) Memo method on memory typewriter
KR910014228A (en) Calculation method of electronic typewriter
KR930024371A (en) Memo function processing method using a telephone
KR970022707A (en) How to input repeated numeric data using flags
KR940023288A (en) Key input display method and device
KR890004227A (en) Vacuum Fluorescent Display Device Control Circuit and Control Method in Base Program
KR940012215A (en) How to find a part of the cash register
JPH04157562A (en) Abbreviated word processor
KR950020100A (en) How to Display Message of Operating System Kernel Using Shared Memory
KR920007369A (en) How to use pager CPU
JPS63112883A (en) Magnetic disk file name converting system

Legal Events

Date Code Title Description
WITN Withdrawal due to no request for examination