WIPO logo
Mobile | Deutsch | Español | Français | 日本語 | 한국어 | Português | Русский | 中文 | العربية |
PATENTSCOPE

Search International and National Patent Collections
World Intellectual Property Organization
Search
 
Browse
 
Translate
 
Options
 
News
 
Login
 
Help
 
Machine translation
1. (WO2007005699) TASK SCHEDULING TO DEVICES WITH SAME CONNECTION ADDRESS
Latest bibliographic data on file with the International Bureau   

Pub. No.:    WO/2007/005699    International Application No.:    PCT/US2006/025753
Publication Date: 11.01.2007 International Filing Date: 29.06.2006
IPC:
G06F 13/38 (2006.01), H04L 12/56 (2006.01), G06F 9/46 (2006.01), G06F 3/06 (2006.01)
Applicants: INTEL CORPORATION [US/US]; 2200 Mission College Boulevard, Santa Clara, CA 95052 (US) (For All Designated States Except US).
CHANG, Nai-Chih [--/US]; (US) (For US Only).
LAU, Victor [CN/US]; (US) (For US Only).
SETO, Pak-lung [US/US]; (US) (For US Only).
HALLECK, William [US/US]; (US) (For US Only)
Inventors: CHANG, Nai-Chih; (US).
LAU, Victor; (US).
SETO, Pak-lung; (US).
HALLECK, William; (US)
Agent: SCHELLER, James, C.; BLAKELY, SOKOLOFF, TAYLOR & ZAFMAN LLP, 12400 Wilshire Boulevard, 7th Floor, Los Angeles, CA 90025 (US)
Priority Data:
11/172,776 30.06.2005 US
Title (EN) TASK SCHEDULING TO DEVICES WITH SAME CONNECTION ADDRESS
(FR) ORDONNANCEMENT DES TACHES DESTINEES A DES PERIPHERIQUES AUX ADRESSES DE CONNEXION IDENTIQUES
Abstract: front page image
(EN)Methods of scheduling tasks in computer systems architectures are disclosed. In one aspect, a method may include comparing a connection address of a first node with a connection address of a second node, determining that the connection address of the first node matches the connection address of the second node, and scheduling tasks to the first and second nodes based, at least in part, on the determination. Apparatus to implement task scheduling, and systems including the apparatus are also disclosed.
(FR)La présente invention concerne des procédés d'ordonnancement de tâches dans des architectures de systèmes informatiques. Pour un aspect, le procédé consiste à comparer l'adresse de connexion d'un premier noeud à une adresse de connexion d'un deuxième noeud, à déterminer que l'adresse de connexion du premier noeud correspond à l'adresse de connexion du deuxième noeud, et à ordonnancer les tâches destinées au premier et au deuxième noeud, sur la base au moins en partie de cette mise en évidence. L'invention concerne également un appareil pour la mise en oeuvre de l'ordonnancement des tâches, et des systèmes comprenant l'appareil.
Designated States: AE, AG, AL, AM, AT, AU, AZ, BA, BB, BG, BR, BW, BY, BZ, CA, CH, CN, CO, CR, CU, CZ, DE, DK, DM, DZ, EC, EE, EG, ES, FI, GB, GD, GE, GH, GM, HN, HR, HU, ID, IL, IN, IS, JP, KE, KG, KM, KN, KP, KR, KZ, LA, LC, LK, LR, LS, LT, LU, LV, LY, MA, MD, MG, MK, MN, MW, MX, MZ, NA, NG, NI, NO, NZ, OM, PG, PH, PL, PT, RO, RS, RU, SC, SD, SE, SG, SK, SL, SM, SY, TJ, TM, TN, TR, TT, TZ, UA, UG, US, UZ, VC, VN, ZA, ZM, ZW.
African Regional Intellectual Property Organization (BW, GH, GM, KE, LS, MW, MZ, NA, SD, SL, SZ, TZ, UG, ZM, ZW)
Eurasian Patent Organization (AM, AZ, BY, KG, KZ, MD, RU, TJ, TM)
European Patent Office (AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HU, IE, IS, IT, LT, LU, LV, MC, NL, PL, PT, RO, SE, SI, SK, TR)
African Intellectual Property Organization (BF, BJ, CF, CG, CI, CM, GA, GN, GQ, GW, ML, MR, NE, SN, TD, TG).
Publication Language: English (EN)
Filing Language: English (EN)