default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTarek Hagras
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j9]Tarek Hagras, Gamal A. El-Sayed:
Maintaining the completion-time mechanism for Greening tasks scheduling on DVFS-enabled computing platforms. Clust. Comput. 27(6): 7373-7388 (2024)- 2022
- [j8]Tarek Hagras
:
Slack extender mechanism for greening dependent-tasks scheduling on DVFS-enabled computing platforms. J. Supercomput. 78(5): 6275-6295 (2022) - 2021
- [j7]Tarek Hagras, Asmaa Atef, Yousef B. Mahdy:
Greening Duplication-Based Dependent-Tasks Scheduling on Heterogeneous Large-Scale Computing Platforms. J. Grid Comput. 19(1): 13 (2021) - 2019
- [j6]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) - 2017
- [j5]Asmaa Atef, Tarek Hagras, Yousef B. Mahdy, Jan Janecek:
Lower-bound complexity algorithm for task scheduling on heterogeneous grid. Computing 99(11): 1125-1145 (2017) - 2012
- [j4]Tarek Hagras:
A Dynamic Task-Mapping Algorithm for Bag-of-Tasks Applications on Grids. Int. J. Comput. Their Appl. 19(4): 243-248 (2012) - 2005
- [j3]Tarek Hagras, Jan Janecek:
A Machine Assignment Mechanism for Compile-Time List-Scheduling Heuristics. Comput. Artif. Intell. 24(4): 341-350 (2005) - [j2]Tarek Hagras, Jan Janecek:
A Fast Compile-Time Task Scheduling Heuristic for Homogeneous Computing Environments. Int. J. Comput. Their Appl. 12(2): 76-82 (2005) - [j1]Tarek Hagras, Jan Janecek:
A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. Parallel Comput. 31(7): 653-670 (2005)
Conference and Workshop Papers
- 2004
- [c7]Tarek Hagras, Jan Janecek:
High Performance Duplication-Based Algorithm for Compile-Time Task Scheduling in a Bounded Number of Heterogeneous Machines. PDCS 2004: 104-109 - [c6]Tarek Hagras, Jan Janecek:
An Approach to Compile-Time Task Scheduling in Heterogeneous Computing Systems. ICPP Workshops 2004: 182-189 - [c5]Tarek Hagras, Jan Janecek:
A High Performance, Low Complexity Algorithm for Compile-Time Task Scheduling in Heterogeneous Systems. IPDPS 2004 - [c4]Tarek Hagras, Jan Janecek:
A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems. ISPDC/HeteroPar 2004: 106-113 - [c3]Tarek Hagras, Jan Janecek:
A Static Task Scheduling Heuristic for Homogeneous Computing Environments. PDP 2004: 192- - 2003
- [c2]Tarek Hagras, Jan Janecek:
A High Performance, Low Complexity Algorithm for Compile-Time Job Scheduling in Homogeneous Computing Environments. ICPP Workshops 2003: 149-155 - [c1]Tarek Hagras, Jan Janecek:
A Simple Scheduling Heuristic for Heterogeneous Computing Environments. ISPDC 2003: 104-110
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-15 00:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
