ReP USP - Resultado da busca

Trabalho de evento
A model for parallel job scheduling on dynamic computer grids (2003)
Goldman, Alfredo ; Queiroz, Carlos
Source: Proceedings. Conference titles: ACM/IFIP/USENIX International Middleware Conference - Middleware 2003. Unidade: IME
Subjects: SISTEMAS DISTRIBUÍDOS, PROGRAMAÇÃO PARALELA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GOLDMAN, Alfredo e QUEIROZ, Carlos. A model for parallel job scheduling on dynamic computer grids. 2003, Anais.. Rio de Janeiro: PUC, 2003. Disponível em: https://repositorio.usp.br/directbitstream/debe492c-c860-48fa-802e-1bdb9628ae72/3187200.pdf. Acesso em: 27 nov. 2025.
APA
Goldman, A., & Queiroz, C. (2003). A model for parallel job scheduling on dynamic computer grids. In Proceedings. Rio de Janeiro: PUC. Recuperado de https://repositorio.usp.br/directbitstream/debe492c-c860-48fa-802e-1bdb9628ae72/3187200.pdf
NLM
Goldman A, Queiroz C. A model for parallel job scheduling on dynamic computer grids [Internet]. Proceedings. 2003 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/debe492c-c860-48fa-802e-1bdb9628ae72/3187200.pdf
Vancouver
Goldman A, Queiroz C. A model for parallel job scheduling on dynamic computer grids [Internet]. Proceedings. 2003 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/debe492c-c860-48fa-802e-1bdb9628ae72/3187200.pdf
Trabalho de evento
InteGrade: object-oriented Grid middleware leveraging the idle computing power of desktop machines (2003)
Goldchleger, Andrei; Kon, Fábio ; Goldman, Alfredo ; Finger, Marcelo
Source: Proceedings. Conference titles: ACM/IFIP/USENIX International Middleware Conference - Middleware 2003. Unidade: IME
Assunto: SISTEMAS DISTRIBUÍDOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GOLDCHLEGER, Andrei et al. InteGrade: object-oriented Grid middleware leveraging the idle computing power of desktop machines. 2003, Anais.. Rio de Janeiro: PUC, 2003. Disponível em: https://repositorio.usp.br/directbitstream/9d322454-f746-44fc-9688-06b6e02ba906/3187190.pdf. Acesso em: 27 nov. 2025.
APA
Goldchleger, A., Kon, F., Goldman, A., & Finger, M. (2003). InteGrade: object-oriented Grid middleware leveraging the idle computing power of desktop machines. In Proceedings. Rio de Janeiro: PUC. Recuperado de https://repositorio.usp.br/directbitstream/9d322454-f746-44fc-9688-06b6e02ba906/3187190.pdf
NLM
Goldchleger A, Kon F, Goldman A, Finger M. InteGrade: object-oriented Grid middleware leveraging the idle computing power of desktop machines [Internet]. Proceedings. 2003 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/9d322454-f746-44fc-9688-06b6e02ba906/3187190.pdf
Vancouver
Goldchleger A, Kon F, Goldman A, Finger M. InteGrade: object-oriented Grid middleware leveraging the idle computing power of desktop machines [Internet]. Proceedings. 2003 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/9d322454-f746-44fc-9688-06b6e02ba906/3187190.pdf
Artigo de periodico
1-optimality of static BSP computations: scheduling independent chains as a case study (2003)
Goldman, Alfredo ; Mounie, Gregory; Trystram, Denis
Source: Theoretical Computer Scence. Unidade: IME
Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GOLDMAN, Alfredo e MOUNIE, Gregory e TRYSTRAM, Denis. 1-optimality of static BSP computations: scheduling independent chains as a case study. Theoretical Computer Scence, v. 290, n. 3, p. 1331-1359, 2003Tradução . . Disponível em: https://doi.org/10.1016/S0304-3975(02)00039-7. Acesso em: 27 nov. 2025.
APA
Goldman, A., Mounie, G., & Trystram, D. (2003). 1-optimality of static BSP computations: scheduling independent chains as a case study. Theoretical Computer Scence, 290( 3), 1331-1359. doi:10.1016/S0304-3975(02)00039-7
NLM
Goldman A, Mounie G, Trystram D. 1-optimality of static BSP computations: scheduling independent chains as a case study [Internet]. Theoretical Computer Scence. 2003 ; 290( 3): 1331-1359.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/S0304-3975(02)00039-7
Vancouver
Goldman A, Mounie G, Trystram D. 1-optimality of static BSP computations: scheduling independent chains as a case study [Internet]. Theoretical Computer Scence. 2003 ; 290( 3): 1331-1359.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/S0304-3975(02)00039-7
Trabalho de evento
A parallel algorithm for enumerating combinations (2003)
Torres, Martha; Goldman, Alfredo ; Barrera, Júnior
Source: Proceedings. Conference titles: International Conference on Parallel Processing. Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, PROGRAMAÇÃO DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TORRES, Martha e GOLDMAN, Alfredo e BARRERA, Júnior. A parallel algorithm for enumerating combinations. 2003, Anais.. Los Alamitos: IEEE, 2003. Disponível em: https://doi.org/10.1109/ICPP.2003.1240626. Acesso em: 27 nov. 2025.
APA
Torres, M., Goldman, A., & Barrera, J. (2003). A parallel algorithm for enumerating combinations. In Proceedings. Los Alamitos: IEEE. doi:10.1109/ICPP.2003.1240626
NLM
Torres M, Goldman A, Barrera J. A parallel algorithm for enumerating combinations [Internet]. Proceedings. 2003 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/ICPP.2003.1240626
Vancouver
Torres M, Goldman A, Barrera J. A parallel algorithm for enumerating combinations [Internet]. Proceedings. 2003 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/ICPP.2003.1240626

USP Schools

ReP

Filtros

Authors