会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 56. 发明专利
    • COMMUNICATION METHOD
    • JPH10164176A
    • 1998-06-19
    • JP27164297
    • 1997-10-03
    • HITACHI LTD
    • ONO RYUICHIASAI MITSUOYAMASHITA YOJITAKIYASU YOSHIHIRO
    • H04L29/08
    • PROBLEM TO BE SOLVED: To effectively transmit and receive the data even in a fast communication mode set for transfer of animations, etc., by securing the logical connection between the transmitting and receiving terminals, securing the correspondence between the receiving and transmitting requests by means of the identifiers added to both requests, and transferring the data to the receiving terminal from the transmitting terminal. SOLUTION: The computers 400 and 460 are connected to each other via a network 430, and the lower order protocol modules 406 and 466 control the data transmission function between both computers. Then an application or higher order protocol modules 402 and 462 designate an identifier of a receiving computer and an identifier that identifies the receiving opposite party of the receiving computer or a connection identifier to the middle order protocol modules 404 and 464 to perform the logical connection, to designate the designation of data, etc. Furthermore, a transmitting/receiving buffer, its length, etc., are designated for designation of the storing places of data to be transmitted and received.
    • 60. 发明专利
    • TASK SCHEDULING METHOD
    • JPH0855036A
    • 1996-02-27
    • JP21063294
    • 1994-08-11
    • HITACHI LTD
    • SHIBATA KOICHIASAI MITSUOSATOU MIKIKOTAKIYASU YOSHIHIROSAITO ATSUSHI
    • G06F9/46G06F9/48
    • PURPOSE:To make the average performance of a system and its real time property compatible by determining a task execution order from information relating to inter-task continuity and dead lines included in execution starting requests from respective tasks by a scheduler. CONSTITUTION:Activation permission requests 103a to 103c from respective processing tasks 101a to 101c are received in an activation permission request queue 104. When the scheduler 102 is activated, an insertion and rearrangement step 105 is operated and the activation permission requests 103a to 103c from the respective processing tasks are taken out from the activation permission request queue 104 and inserted in a task chart 106. At the time, the execution of the tasks is basically permitted in the order of the starting time limits. Then, as long as the completion dead lines of the respective tasks are kept, the task with high continuity is successively selected. In the meantime, when the execution of the task with the high degree of urgency is requested, the task close to the completion dead line is selected and preferentially executed. Thus, the overhead of task transition is reduced and the dead line is kept.