IP Library › Granted Patent US 10,659,557
Granted Patent B2
US 10,659,557 · App. 15/911,385 · Granted May 19, 2020

Information processing apparatus, information processing method, and computer program product

Inventors: Yasin Oge (Sagamihara, JP); Yuta Kobayashi (Kawasaki, JP); Takahiro Yamaura (Kawasaki, JP)
Assignee: Kabushiki Kaisha Toshiba
H04L67/2847H04L47/2416H04L47/625H04L49/206H04L49/3027H04L49/90
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,659,557
App. No.
15/911,385
Granted
May 19, 2020
Kind
B2
Abstract

According to an embodiment, an information processing apparatus includes a prefetch unit and a scheduler unit. The prefetch unit is configured to prefetch a scheduling entry corresponding a future time period in advance from scheduling information including one or more entries each of which at least contains a transmission state and interval for each of one or more transmission queues. The scheduler unit configured to determine a starting time of transmission for each frame waiting for transmission in each queue, on the basis of the prefetched entry.

Claims (64)

1. An information processing method comprising:

prefetching a scheduling entry corresponding to a future time period in advance from scheduling information including a first starting time and one or more scheduling entries, each entry at least containing a transmission state and an interval for each of one or more transmission queues;

determining a second starting time of transmission for each of one or more frames waiting for transmission in each transmission queue, based on the scheduling entry and the first starting time;

performing a notification to prefetch a next entry from the scheduling information;

prefetching the next entry when the notification is received; and

at a future time that is a first future time or a second future time,

sending the notification based on an available time for transmission for each and every transmission queue at the first future time, which is a prospective time to schedule future transmission, or

sending the notification based on the available time of each transmission queue at the second future time, and a time difference between a current time and the second future time.

2. The information processing method according to claim 1 , further comprising:

starting transmission of a frame, based on the second starting time of transmission.

3. The information processing method according to claim 1 , further comprising:

evaluating each frame waiting for transmission in each transmission queue and determining one or more schedulable frames, if any exist, and

scheduling the second starting time of transmission for a first schedulable frame of the one or more schedulable frames.

4. The information processing method according to claim 1 , further comprising:

updating the future time, which is a prospective time to schedule future transmission, and an available time for transmission for each transmission queue at the future time, on the basis of the scheduling entry.

5. The information processing method according to claim 1 , further comprising:

updating the future time and the available time of each transmission queue, using a required amount of time to transmit a scheduled frame.

6. The information processing method according to claim 1 , further comprising:

updating the available time of each transmission queue, based on a time difference between a current time and the future time.

7. The information processing method according to claim 1 , wherein the future time period is specified with the second starting time and an end time of a period for which the transmission state is valid, or the second starting time and a specific amount of time for which the transmission state is valid.

8. The information processing method according to claim 1 , wherein the scheduling information includes information provided in IEEE 802.1Qbv standard.

9. A computer program product comprising a non-transitory computer-readable storage medium including programmed instructions, the instructions causing a computer to execute:

prefetching a scheduling entry corresponding to a future time period in advance from scheduling information including a first starting time and one or more scheduling entries, each entry at least containing a transmission state and an interval for each of one or more transmission queues;

determining a second starting time of transmission for each of one or more frames waiting for transmission in each transmission queue, based on the scheduling entry and the first starting time;

performing a notification to prefetch a next entry from the scheduling information;

prefetching the next entry when the notification is received; and

at a future time that is a first future time or a second future time,

sending the notification based on an available time for transmission for each and every transmission queue at the first future time, which is a prospective time to schedule future transmission, or

sending the notification based on the available time of each transmission queue at the second future time, and a time difference between a current time and the second future time.

10. The information processing method according to claim 3 , further comprising:

determining whether or not each frame waiting for transmission is schedulable, which means each frame is transmittable within the available time of each corresponding transmission queue at the future time.

11. The information processing method according to claim 3 , further comprising:

selecting a schedulable frame from the one or more schedulable frames, and scheduling the second starting time of transmission for the selected frame.

12. An information processing method comprising:

prefetching a scheduling entry corresponding to a future time period in advance from scheduling information including a first starting time and one or more scheduling entries, each entry at least containing a transmission state and an interval for each of one or more transmission queues;

determining a second starting time of transmission for each of one or more frames waiting for transmission in each transmission queue, based on the scheduling entry and the first starting time;

performing a notification to prefetch a next entry from the scheduling information;

prefetching the next entry when the notification is received; and

sending the notification based on an available time for transmission for each and every transmission queue at a future time, which is a prospective time to schedule future transmission, and

sending the notification based on the available time of each transmission queue at the future time, and a time difference between a current time and the future time.

13. The information processing method according to claim 12 , further comprising:

starting transmission of a frame, based on the second starting time of transmission.

14. The information processing method according to claim 12 , further comprising:

evaluating each frame waiting for transmission in each transmission queue and determining one or more schedulable frames, if any exist, and

scheduling the second starting time of transmission for a first schedulable frame of the one or more schedulable frames.

15. The information processing method according to claim 12 , further comprising:

updating the future time, which is a prospective time to schedule future transmission, and an available time for transmission for each transmission queue at the future time, on the basis of the scheduling entry.

16. The information processing method according to claim 12 , further comprising:

updating the future time and the available time of each transmission queue, using a required amount of time to transmit a scheduled frame.

17. The information processing method according to claim 12 , further comprising:

updating the available time of each transmission queue, based on a time difference between a current time and the future time.

18. The information processing method according to claim 12 , wherein the future time period is specified with the second starting time and an end time of a period for which the transmission state is valid, or the second starting time and a specific amount of time for which the transmission state is valid.

19. The information processing method according to claim 12 , wherein the scheduling information includes information provided in IEEE 802.1Qbv standard.

20. The information processing method according to claim 14 , further comprising:

determining whether or not each frame waiting for transmission is schedulable, which means each frame is transmittable within the available time of each corresponding transmission queue at the future time.

21. The information processing method according to claim 14 , further comprising:

selecting a schedulable frame from the one or more schedulable frames, and scheduling the second starting time of transmission for the selected frame.

22. A computer program product comprising a non-transitory computer-readable storage medium including programmed instructions, the instructions causing a computer to execute:

prefetching a scheduling entry corresponding to a future time period in advance from scheduling information including a first starting time and one or more scheduling entries, each entry at least containing a transmission state and an interval for each of one or more transmission queues;

determining a second starting time of transmission for each of one or more frames waiting for transmission in each transmission queue, based on the scheduling entry and the first starting time;

performing a notification to prefetch a next entry from the scheduling information;

prefetching the next entry when the notification is received; and

sending the notification based on an available time for transmission for each and every transmission queue at a future time, which is a prospective time to schedule future transmission, and

sending the notification based on the available time of each transmission queue at the future time, and a time difference between a current time and the future time.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 5, 2018
From: OGE, YASIN; KOBAYASHI, YUTA; YAMAURA, TAKAHIRO
To: KABUSHIKI KAISHA TOSHIBA
Reel/Frame 045836/0843 →
Priority Claims (1)
JP 2017-221998 · Nov 17, 2017 · national
Continuity (1)
Related Publication 20190158620A1 · May 23, 2019
Cited By (1)
US 12,250,154