A flexible architecture for scheduling parallel applications on oportunistic computer networks (2006)
- Authors:
- Autor USP: LEJBMAN, ALFREDO GOLDMAN VEL - IME
- Unidade: IME
- Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
- Language: Inglês
- Imprenta:
-
ABNT
NETTO, Marco A. S. e GOLDMAN, Alfredo e DUTOT, Pierre-François. A flexible architecture for scheduling parallel applications on oportunistic computer networks. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/795555c1-8c4d-4865-8e4e-3695e8bbd291/1535959.pdf. Acesso em: 19 abr. 2024. , 2006 -
APA
Netto, M. A. S., Goldman, A., & Dutot, P. -F. (2006). A flexible architecture for scheduling parallel applications on oportunistic computer networks. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/795555c1-8c4d-4865-8e4e-3695e8bbd291/1535959.pdf -
NLM
Netto MAS, Goldman A, Dutot P-F. A flexible architecture for scheduling parallel applications on oportunistic computer networks [Internet]. 2006 ;[citado 2024 abr. 19 ] Available from: https://repositorio.usp.br/directbitstream/795555c1-8c4d-4865-8e4e-3695e8bbd291/1535959.pdf -
Vancouver
Netto MAS, Goldman A, Dutot P-F. A flexible architecture for scheduling parallel applications on oportunistic computer networks [Internet]. 2006 ;[citado 2024 abr. 19 ] Available from: https://repositorio.usp.br/directbitstream/795555c1-8c4d-4865-8e4e-3695e8bbd291/1535959.pdf - 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
- Scheduling with duplication on m processors with small communication delays
- A MILP approach to schedule parallel independent tasks
- A delay-tolerant network routing algorithm based on column generation
- A model for parallel job scheduling on dynamic computer grids
- 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
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 1535959.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
