"Lower-bound time-complexity greening mechanism for duplication-based ..."

Tarek Hagras, Asmaa Atef, Yousef B. Mahdy (2019)

> Home

Details and statistics

DOI: 10.1007/S11227-019-02982-8

access: closed

type: Journal Article

metadata version: 2020-05-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tjs/HagrasAM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tjs/HagrasAM19
Tarek Hagras, Asmaa Atef, Yousef B. Mahdy:
Lower-bound time-complexity greening mechanism for duplication-based scheduling on large-scale computing platforms. J. Supercomput. 75(12): 8147-8167 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.