Scheduling with duplication on m processors with small communication delays (2001)
- Authors:
- Autor USP: LEJBMAN, ALFREDO GOLDMAN VEL - IME
- Unidade: IME
- DOI: 10.1016/S1571-0653(04)00255-0
- Assunto: SCHEDULING
- Keywords: communication delays; performance guarantee
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Electronic Notes in Discrete Mathematics
- ISSN: 1571-0653
- Volume/Número/Paginação/Ano: v. 7, p. 182-185, 2001
- Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
GOLDMAN, Alfredo e RAPINE, Christophe. Scheduling with duplication on m processors with small communication delays. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/S1571-0653(04)00255-0. Acesso em: 28 mar. 2024. , 2001 -
APA
Goldman, A., & Rapine, C. (2001). Scheduling with duplication on m processors with small communication delays. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/S1571-0653(04)00255-0 -
NLM
Goldman A, Rapine C. Scheduling with duplication on m processors with small communication delays [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 182-185.[citado 2024 mar. 28 ] Available from: https://doi.org/10.1016/S1571-0653(04)00255-0 -
Vancouver
Goldman A, Rapine C. Scheduling with duplication on m processors with small communication delays [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 182-185.[citado 2024 mar. 28 ] Available from: https://doi.org/10.1016/S1571-0653(04)00255-0 - A model for parallel job schedulling on dynamical computer grids
- Exchanging messages of different sizes
- Combining parallel algorithms solving the same application: what is the best approach?
- Actor scheduling for multicore hierarchical memory platforms
- A MILP approach to schedule parallel independent tasks
- A delay-tolerant network routing algorithm based on column generation
- 1-optimality of static BSP computations: scheduling independent chains as a case study
- Condições de conectividade de algoritmos de exclusão mútua em redes dinâmicas
- 17o. Wperformance Workshop em desempenho de sistemas computacionais e de comunicação. [Apresentação]
- A model for parallel job scheduling on dynamic computer grids
Informações sobre o DOI: 10.1016/S1571-0653(04)00255-0 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas