| dbo:abstract
|
- In computer science, the thundering herd problem occurs when a large number of processes or threads waiting for an event are awoken when that event occurs, but only one process is able to handle the event. When the processes wake up, they will each try to handle the event, but only one will win. All processes will compete for resources, possibly freezing the computer, until the herd is calmed down again. (en)
- 惊群问题是计算机科学中，当许多进程等待一个事件，事件发生后这些进程被唤醒，但只有一个进程能获得CPU执行权，其他进程又得被阻塞，这造成了严重的系统上下文切换代价。 解决办法可能有： 1.
* 不希望把所有进程都唤醒，就采用定点唤醒某一个进程的做法。 2.
* 尽量避免进程上下文切换。 C10K问题（Concurrent 10,000 Connections），指服务器同时支持上万个客户端连接的问题。可用Linux的epoll，FreeBSD的kqueue，Solaris的/dev/poll来解决。 C10M问题，是千万级并发实现。Linux上通常用epoll实现。 (zh)
|
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 2891 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| rdfs:comment
|
- In computer science, the thundering herd problem occurs when a large number of processes or threads waiting for an event are awoken when that event occurs, but only one process is able to handle the event. When the processes wake up, they will each try to handle the event, but only one will win. All processes will compete for resources, possibly freezing the computer, until the herd is calmed down again. (en)
- 惊群问题是计算机科学中，当许多进程等待一个事件，事件发生后这些进程被唤醒，但只有一个进程能获得CPU执行权，其他进程又得被阻塞，这造成了严重的系统上下文切换代价。 解决办法可能有： 1.
* 不希望把所有进程都唤醒，就采用定点唤醒某一个进程的做法。 2.
* 尽量避免进程上下文切换。 C10K问题（Concurrent 10,000 Connections），指服务器同时支持上万个客户端连接的问题。可用Linux的epoll，FreeBSD的kqueue，Solaris的/dev/poll来解决。 C10M问题，是千万级并发实现。Linux上通常用epoll实现。 (zh)
|
| rdfs:label
|
- Thundering herd problem (en)
- 惊群问题 (zh)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:wikiPageDisambiguates
of | |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
