- -

DVFS-control techniques for dense linear algebra operations on multi-core processors

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

DVFS-control techniques for dense linear algebra operations on multi-core processors

Mostrar el registro completo del ítem

Alonso-Jordá, P.; Dolz Zaragozá, MF.; Igual, FD.; Mayo, R.; Quintana Ortí, ES. (2012). DVFS-control techniques for dense linear algebra operations on multi-core processors. Computer Science - Research and Development. 27(4):289-298. https://doi.org/10.1007/s00450-011-0188-7

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/59290

Ficheros en el ítem

[Cerrado]
Nombre: 10.1007_s00450-01 ...
Tamaño: 1.319Mb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor

Metadatos del ítem

Título: DVFS-control techniques for dense linear algebra operations on multi-core processors
Autor: Alonso-Jordá, Pedro Dolz Zaragozá, Manuel Francisco Igual, Francisco D. Mayo, Rafael Quintana Ortí, Enrique Salvador
Entidad UPV: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Fecha difusión:
Resumen:
[EN] This paper analyzes the impact on power con- sumption of two DVFS-control strategies when applied to the execution of dense linear algebra operations on multi- core processors. The strategies considered here, prototyped ...[+]
Palabras clave: Dense linear algebra , Power consumption , Multi-core processors , DVFS
Derechos de uso: Cerrado
Fuente:
Computer Science - Research and Development. (issn: 1865-2034 )
DOI: 10.1007/s00450-011-0188-7
Editorial:
Springer Verlag (Germany)
Versión del editor: http://dx.doi.org/10.1007/s00450-011-0188-7
Código del Proyecto:
info:eu-repo/grantAgreement/MICINN//TIN2008-06570-C04-01/ES/CONSTRUCCION Y OPTIMIZACION AUTOMATICAS DE BIBLIOTECAS PARALELAS DE COMPUTACION CIENTIFICA - UJI/
info:eu-repo/grantAgreement/MICINN//TIN2008-06570-C04-04/ES/CONSTRUCCION Y OPTIMIZACION AUTOMATICAS DE BIBLIOTECAS PARALELAS DE COMPUTACION CIENTIFICA - UA/
info:eu-repo/grantAgreement/MICINN//TIN2008-06570-C04-02/ES/CONSTRUCCION Y OPTIMIZACION AUTOMATICAS DE BIBLIOTECAS PARALELAS DE COMPUTACION CIENTIFICA - UM/
Agradecimientos:
The authors from Univ. Jaume I were supported by project CICYT TIN2008-06570-C04 and FEDER.
Tipo: Artículo

References

Albers S (2010) Energy-efficient algorithms. Commun ACM 53:86–96

Dongarra J et al. (2011) The international ExaScale software project roadmap. Int J High Perform Comput Appl, 25(1):3–60

Duranton M et al. (2010) The HiPEAC vision. Available from http://www.hipeac.net/roadmap [+]
Albers S (2010) Energy-efficient algorithms. Commun ACM 53:86–96

Dongarra J et al. (2011) The international ExaScale software project roadmap. Int J High Perform Comput Appl, 25(1):3–60

Duranton M et al. (2010) The HiPEAC vision. Available from http://www.hipeac.net/roadmap

Feng W, Feng X, Ce R (2008) Green supercomputing comes of age. IT Prof 10(1):17–23

Gruber R, Keller V (2010) One joule per GFlop for BLAS2 now! In: Simos TE, Psihoyios G, Tsitouras C (eds) AIP conf proceedings, vol 1281. American Institute of Physics, College Park, pp 1321–1324

Ludwig T (2010) Editorial for the first international conference on energy-aware high performance computing. Comput Sci Res Dev 25(3):123–124

Golub GH, Van Loan CF (1996) Matrix computations, 3rd edn. The Johns Hopkins University Press, Baltimore

Van Zee FG (2009) libflame: the complete reference. www.lulu.com

Anderson E, Bai Z, Bischof C, Blackford LS, Demmel J, Dongarra JJ, Croz Du J, Hammarling S, Greenbaum A, McKenney A, Sorensen D (1999) LAPACK users’ guide, 3rd edn. SIAM, Philadelphia

Hsu C, Feng W (2005) A feasibility analysis of power awareness in commodity-based high-performance clusters. In: Cluster 2005

Quintana-Ortí ES, van de Geijn RA (2008) Updating an LU factorization with pivoting. ACM Trans Math Softw 35(2):11:1–11:16

Quintana-Ortí G, Quintana-Ortí ES, van de Geijn RA, Van Zee FG, Chan E (2009) Programming matrix algorithms-by-blocks for thread-level parallelism. ACM Trans Math Softw 36(3):14:1–14:26

Freeh VW, Lowenthal DK, Pan F, Kappiah N, Springer R, Rountree BL, Femal ME (2007) Analyzing the energy-time trade-off in high-performance computing applications. IEEE Trans Parallel Distrib Syst 18:835–848

King D, Ahmad I, Sheikh HF (2010) Stretch and compress based re-scheduling techniques for minimizing the execution times of DAGs on multi-core processors under energy constraints. In: International conference on green computing. IEEE Press, New York, pp 49–60

Palli K (2005) Scheduling dags for minimum finish time and power consumption on heterogeneous processors. Master’s thesis, Albers University, Albers, AL

Shaffer LR, Ritter JB, Meyer WL (1965) The critical-path method. McGraw-Hill, New York

Alonso P, Dolz MF, Mayo R, Quintana-Ortí ES (2011) Improving power efficiency of dense linear algorithms on multi-core processors via slack control. Proceedings of the 2011 international conference on high performance computing & simulation (HPCS 2011). IEE Catzlog Number. CFP1178H-CDR, pp. 463–470

Alonso P, Dolz MF, Mayo R, Quintana-Ortí ES (2011) Energy-aware scheduling of dense linear algebra operations on multi-core processors. Technical report 2011-04-01, Depto. de Ingeniería y Ciencia de los Computadores, Universitat Jaume I, April 2011

Li R, Huang HC (2007) List scheduling for jobs with arbitrary release times and similar lengths. J Sched 10(6):365–373

Mtibaa A, Ouni B, Abid M (2007) An efficient list scheduling algorithm for time placement problem. Comput Electr Eng 33(4):285–298

[-]

recommendations

 

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro completo del ítem