Dining philosophers problem
Problem used to illustrate synchronization issues and techniques for resolving them
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals and then formulated in terms of diners, dubbed the "dining quintet".
Nº Q865867 ★★★
Rara · História
Dining philosophers problem
Problem used to illustrate synchronization issues and techniques for resolving them
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals and then formulated in terms of diners, dubbed the "dining quintet".
Último preço
—
Preço mínimo
—
Mediana 7 d
—
Vendas 30 d
0
Faixa 30 d
—
Em circulação
0
Cotação
mediana
mín – máx
vendas
Sem vendas no período
Ver tabela
| Data | mediana | Mín | Máx | vendas |
|---|
Histórico de vendas
- Última venda
- —
- Média 30 d
- —
- Mínima 30 d
- —
- Máxima 30 d
- —
- Vendas 7 d
- 0
- Vendas 30 d
- 0
Ainda sem vendas.
Vendas anônimas: sem comprador nem vendedor. Os números contam só vendas entre jogadores.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals and then formulated in terms of diners, dubbed the "dining quintet". Soon after, Tony Hoare gave the problem its present name.
Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Benjamin D. Esham (bdesham) (CC BY-SA 3.0) ·
Cartas próximas
Entscheidungsproblem
Nº Q11030584 ★★
Edsger Dijkstra
Cientista da computação holandês
Nº Q8556 ★★★
Teoria do macaco chapado
Nº Q115857865 ★★★
My Dinner with Adolf
Satirical short story by Larry David
Nº Q134455096 ★★
Sexto problema de Hilbert
Nº Q10370880 ★★
Problema de roteamento de veículos
Nº Q944041 ★★