default search action
Ghassan Shobaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Ghassan Shobaki, Pinar Muyan-Özçelik, Josh Hutton, Bruce Linck, Vladislav Malyshenko, Austin Kerbow, Ronaldo Ramirez-Ortega, Vahl Scott Gordon:
Instruction Scheduling for the GPU on the GPU. CGO 2024: 435-447 - 2023
- [j7]Taspon Gonggiatgul, Ghassan Shobaki, Pinar Muyan-Özçelik:
A parallel branch-and-bound algorithm with history-based domination and its application to the sequential ordering problem. J. Parallel Distributed Comput. 172: 131-143 (2023) - [c8]Ghassan Shobaki, Taspon Gonggiatgul, Jacob Normington, Pinar Muyan-Özçelik:
Combining a Parallel Branch-and-Bound Algorithm with a Strong Heuristic to Solve the Sequential Ordering Problem. ICPP Workshops 2023: 162-166 - 2022
- [j6]Ghassan Shobaki, Vahl Scott Gordon, Paul McHugh, Theodore Dubois, Austin Kerbow:
Register-Pressure-Aware Instruction Scheduling Using Ant Colony Optimization. ACM Trans. Archit. Code Optim. 19(2): 23:1-23:23 (2022) - [c7]Ghassan Shobaki, Justin Bassett, Mark Heffernan, Austin Kerbow:
Graph transformations for register-pressure-aware instruction scheduling. CC 2022: 41-53 - [c6]Taspon Gonggiatgul, Ghassan Shobaki, Pinar Muyan-Özçelik:
A parallel branch-and-bound algorithm with history-based domination. PPoPP 2022: 439-440 - 2020
- [c5]Ghassan Shobaki, Austin Kerbow, Stanislav Mekhanoshin:
Optimizing occupancy and ILP on the GPU using a combinatorial approach. CGO 2020: 133-144
2010 – 2019
- 2019
- [j5]Ghassan Shobaki, Austin Kerbow, Christopher Pulido, William Dobson:
Exploring an Alternative Cost Function for Combinatorial Register-Pressure-Aware Instruction Scheduling. ACM Trans. Archit. Code Optim. 16(1): 1:1-1:30 (2019) - 2017
- [c4]Jafar Jamal, Ghassan Shobaki, Vassilis Papapanagiotou, Luca Maria Gambardella, Roberto Montemanni:
Solving the sequential ordering problem using branch and bound. SSCI 2017: 1-9 - 2016
- [c3]Ghassan Shobaki, Najm Eldeen Abu Rmaileh, Jafar Jamal:
Studying the Impact of Bit Switching on CPU Energy. SCOPES 2016: 173-179 - 2015
- [j4]Ghassan Shobaki, Jafar Jamal:
An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers. Comput. Optim. Appl. 61(2): 343-372 (2015) - [j3]Ghassan Shobaki, Laith Sakka, Najm Eldeen Abu Rmaileh, Hasan Al-Hamash:
Experimental evaluation of various register-pressure-reduction heuristics. Softw. Pract. Exp. 45(11): 1497-1517 (2015) - 2013
- [j2]Ghassan Shobaki, Maxim Shawabkeh, Najm Eldeen Abu Rmaileh:
Preallocation instruction scheduling with register pressure minimization using a combinatorial optimization approach. ACM Trans. Archit. Code Optim. 10(3): 14:1-14:31 (2013)
2000 – 2009
- 2009
- [j1]Ghassan Shobaki, Kent D. Wilken, Mark Heffernan:
Optimal trace scheduling using enumeration. ACM Trans. Archit. Code Optim. 5(4): 19:1-19:32 (2009) - 2006
- [c2]Mark Heffernan, Kent D. Wilken, Ghassan Shobaki:
Data-Dependency Graph Transformations for Superblock Scheduling. MICRO 2006: 77-88 - 2004
- [c1]Ghassan Shobaki, Kent D. Wilken:
Optimal Superblock Scheduling Using Enumeration. MICRO 2004: 283-293
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-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint