GCD
E864394
GCD is Apple’s low-level concurrency and task scheduling framework used to manage asynchronous operations efficiently across multiple cores.
All labels observed (1)
| Label | Occurrences |
|---|---|
| GCD canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T10456496 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: GCD Context triple: [Grand Central Dispatch, alsoKnownAs, GCD]
-
A.
Euclidean algorithm for polynomials
The Euclidean algorithm for polynomials is a procedure that repeatedly applies polynomial division to compute the greatest common divisor of two polynomials over a given field or ring.
-
B.
gauss
The gauss is a unit of magnetic flux density in the centimeter–gram–second (CGS) system, commonly used in physics to measure the strength of magnetic fields.
-
C.
Divisor
"Divisor" is a participatory performance artwork by Brazilian artist Lygia Pape in which participants wear a large white cloth with cut-out holes, collectively transforming individual bodies into a moving geometric form in public space.
-
D.
Goldbach
Goldbach is a locality within the municipality of Küsnacht in the canton of Zürich, Switzerland, situated along the shores of Lake Zurich.
-
E.
Arith
Arith is a small village in the Savoie department of southeastern France, situated within the mountainous Massif des Bauges region.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: GCD Target entity description: GCD is Apple’s low-level concurrency and task scheduling framework used to manage asynchronous operations efficiently across multiple cores.
-
A.
Euclidean algorithm for polynomials
The Euclidean algorithm for polynomials is a procedure that repeatedly applies polynomial division to compute the greatest common divisor of two polynomials over a given field or ring.
-
B.
gauss
The gauss is a unit of magnetic flux density in the centimeter–gram–second (CGS) system, commonly used in physics to measure the strength of magnetic fields.
-
C.
Divisor
"Divisor" is a participatory performance artwork by Brazilian artist Lygia Pape in which participants wear a large white cloth with cut-out holes, collectively transforming individual bodies into a moving geometric form in public space.
-
D.
Goldbach
Goldbach is a locality within the municipality of Küsnacht in the canton of Zürich, Switzerland, situated along the shores of Lake Zurich.
-
E.
Arith
Arith is a small village in the Savoie department of southeastern France, situated within the mountainous Massif des Bauges region.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
Apple technology
ⓘ
concurrency framework ⓘ task scheduling framework ⓘ |
| abbreviation | GCD ⓘ |
| APIStyle |
block-based API in Objective-C
ⓘ
closure-based API in Swift ⓘ |
| competesWith | NSOperationQueue ⓘ |
| coreConcept |
dispatch barrier
ⓘ
dispatch group ⓘ dispatch queue ⓘ dispatch semaphore ⓘ dispatch source ⓘ global concurrent queue ⓘ main queue ⓘ quality of service ⓘ work item ⓘ |
| designGoal |
abstract thread management
ⓘ
improve performance on multicore processors ⓘ simplify multithreaded programming ⓘ |
| developer | Apple Inc. ⓘ |
| documentationURL | https://developer.apple.com/documentation/dispatch ⓘ |
| introducedIn | Mac OS X 10.6 Snow Leopard ⓘ |
| introducedYear | 2009 ⓘ |
| languageBinding |
C
ⓘ
Objective-C ⓘ Swift ⓘ |
| manages | thread pool ⓘ |
| openSourceComponent |
libdispatch
ⓘ
linked to:
Grand Central Dispatch
|
| primaryPurpose |
efficient use of multiple CPU cores
ⓘ
manage asynchronous operations ⓘ manage concurrent code execution ⓘ |
| providedAs |
libdispatch
ⓘ
linked to:
Grand Central Dispatch
|
| relatedTo |
POSIX threads
ⓘ
linked to:
POSIX
|
| runsOn |
iOS
ⓘ
iPadOS ⓘ macOS ⓘ tvOS ⓘ watchOS ⓘ |
| supports |
asynchronous programming
ⓘ
barriers ⓘ dispatch queues ⓘ groups ⓘ parallel execution ⓘ semaphores ⓘ sources ⓘ synchronous programming ⓘ task scheduling ⓘ timers ⓘ work queues ⓘ |
| uses | work-stealing scheduling ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: GCD Description of subject: GCD is Apple’s low-level concurrency and task scheduling framework used to manage asynchronous operations efficiently across multiple cores.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
GCD