$\require{mediawiki-texvc}$

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

Providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems

IPC분류정보
국가/구분 United States(US) Patent 등록
국제특허분류(IPC7판)
  • G06F-009/00
  • G06F-015/173
  • G06F-015/16
출원번호 US-0842213 (2004-05-10)
발명자 / 주소
  • Jones,Michael B.
  • Regehr,John
출원인 / 주소
  • Microsoft Corporation
대리인 / 주소
    Lee & Hayes, PLLC
인용정보 피인용 횟수 : 1  인용 특허 : 25

초록

The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes

대표청구항

The invention claimed is: 1. A method for a computer system having a plurality of processors comprising: receiving a constraint for a thread in an activity specifying a desired earliest start time, amount of requested execution time, and a deadline; determining the thread has previously been run on

이 특허에 인용된 특허 (25)

  1. Boland Vernon K., Affinity scheduling of data within multi-processor computer systems.
  2. Hayashi Masakazu,JPX, Compiling apparatus and method for promoting an optimization effect of a program.
  3. Ferguson Edward E. (Plano TX) Cook Dexter S. (Carrollton TX), Critical task scheduling for real-time systems.
  4. Biliris Alexandros ; Hillyer Bruce K. ; Panagos Euthimios, Dynamic hierarchical network resource scheduling for continuous media.
  5. Chen Ming-Syan (Yorktown Heights NY) Turek John J. E. (Chappaqua NY) Wolf Joel L. (Katonah NY) Yu Philip S. (Chappaqua NY), Hierarchical scheduling method for processing tasks having precedence constraints on a parallel processing system.
  6. Charny Anna, Method and apparatus for hierarchical relative error scheduling.
  7. Chang Pohua, Method and apparatus for managing profile data.
  8. Boetje Gerard J. ; Collier David C., Method and apparatus for the scheduling and ordering of elements in a multimedia environment.
  9. Jones Michael B. ; Leach Paul J. ; Draves ; Jr. Richard P. ; Barrera ; III Joseph S. ; Levi Steven P. ; Rashid Richard F. ; Fitzgerald Robert P., Method and system for scheduling the execution of threads using optional time-specific scheduling constraints.
  10. Jones Michael B. ; Leach Paul J. ; Draves ; Jr. Richard P. ; Barrera ; III Joseph S. ; Levi Steven P. ; Rashid Richard F. ; Fitzgerald Robert P., Method and system for scheduling the use of a computer system resource using a resource planner and a resource provider.
  11. Browning, Luke Matthew; Peek, Jeffrey Scott, Method and system for scheduling threads within a multiprocessor data processing system using an affinity scheduler.
  12. Rusterholz John T. (Roseville MN), Method for generating a preferred processing order and for detecting cycles in a directed graph used to represent system.
  13. Boland Vernon K. ; Brasche Kevin R. ; Smith Kenneth A., Method for load balancing a per processor affinity scheduler wherein processes are strictly affinitized to processors an.
  14. Rasbold James C. (Livermore CA) Van Dyke Don A. (Pleasanton CA), Method for optimizing instruction scheduling for a processor having multiple functional resources.
  15. Sisley Elizabeth M. (Woodbury MN) Collins John E. (Hudson WI), Method for resource assignment and scheduling.
  16. Dworzecki Jozef (Fontenay le Fleury FRX), Method of scheduling successive tasks subject only to timing constraints.
  17. Gupta Rajiv (Ossining NY), Method of synchronizing parallel processors employing channels and compiling method minimizing cross-processor data depe.
  18. Blelloch Guy E. ; Gibbons Phillip B. ; Matias Yossi, Methods and means for scheduling parallel processors.
  19. Carmon Donald E. (Chapel Hill NC), Multi-media computer operating system and method.
  20. Prasanna G.N. Srinivasa, Multiprocessor scheduling and execution.
  21. Farrell Joel A. (Endicott NY) Record Stephen E. (Ridgefield CT) Wade Brian K. (Apalachin NY), Preemptive and non-preemptive scheduling and execution of program threads in a multitasking operating system.
  22. Bahr James E. (Rochester MN) Corrigan Michael J. (Rochester MN) Knipfer Diane L. (Rochester MN) McMahon Lynn A. (Rochester MN) Metzger Charlotte B. (Elgin MN), Process for dispatching tasks among multiple information processors.
  23. Vaitzblit Lev (Concord MA) Ramakrishnan Kadangode K. (Maynard MA) Tzelnic Percy (Concord MA), Scheduling and admission control policy for a continuous media server.
  24. Dimitrijevic Dragomir D. ; Berisford Dale, System and method for multi-dimensional resource scheduling.
  25. Lee Kuo-Chu (Franklin NJ), Tree structured variable priority arbitration implementing a round-robin scheduling policy.

이 특허를 인용한 특허 (1)

  1. Bryant, Jay S.; Kolz, Daniel P.; Patel, Dharmesh J., Process restart on a compute node.
섹션별 컨텐츠 바로가기

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

AI-Helper 아이콘
AI-Helper
안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

선택된 텍스트