Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Raymes Khoury

dblp:05/2099 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 87% Hardware accelerators and domain-specific architectures · 13%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
visual metaphor
0.212013
WeBeVis: analyzing user web behavior through visual metaphors · Sci. China Inf. Sci. 2013
Runtime systems and virtual machines
parallel execution
0.112011
Accelerating the Execution of Matrix Languages on the Cell Broadband Engine Architecture · IEEE Trans. Parallel Distributed Syst. 2011
Parallel and multicore computing
data parallelism
0.112011
Accelerating the Execution of Matrix Languages on the Cell Broadband Engine Architecture · IEEE Trans. Parallel Distributed Syst. 2011
Parallel and multicore computing
parallel programming models
0.112011
Accelerating the Execution of Matrix Languages on the Cell Broadband Engine Architecture · IEEE Trans. Parallel Distributed Syst. 2011
Web and social media mining
user behavior analysis
0.012013
WeBeVis: analyzing user web behavior through visual metaphors · Sci. China Inf. Sci. 2013
Hardware accelerators and domain-specific architectures › many-core accelerator
cell broadband engine
0.012011
Accelerating the Execution of Matrix Languages on the Cell Broadband Engine Architecture · IEEE Trans. Parallel Distributed Syst. 2011

Methods — techniques the papers use, named apart from their topics

visual analytics · 0.3task scheduling · 0.2lazy evaluation · 0.2data dependence graph · 0.2
YearPublicationVenuePosition
2013 WeBeVis: analyzing user web behavior through visual metaphors
Weidong Huang 0001, Raymes Khoury, Tim Dawborn, Bohan Huang, Mao Lin Huang, Xiaodi Huang 0001
Sci. China Inf. Sci.2
2011 Accelerating the Execution of Matrix Languages on the Cell Broadband Engine Architecture
abstract
Matrix languages, including MATLAB and Octave, are established standards for applications in science and engineering. They provide interactive programming environments that are easy to use due to their script languages with matrix data types. Current implementations of matrix languages do not fully utilize high-performance, special-purpose chip architectures, such as the IBM PowerXCell processor (Cell). We present a new framework that extends Octave to harvest the computational power of the Cell. With this framework, the programmer is alleviated of the burden of introducing explicit notions of parallelism. Instead, the programmer uses a new matrix data type to execute matrix operations in parallel on the synergistic processing elements (SPEs) of the Cell. We employ lazy evaluation semantics for our new matrix data type to obtain execution traces of matrix operations. Traces are converted to data dependence graphs; operations in the data dependence graph are lowered (split into submatrices), scheduled and executed on the SPEs. Thereby, we exploit 1) data parallelism, 2) instruction level parallelism, 3) pipeline parallelism, and 4) task parallelism of matrix language programs. We conducted extensive experiments to show the validity of our approach. Our Cell-based implementation achieves speedups of up to a factor of 12 over code run on recent Intel Core2 Quad processors.
Raymes Khoury, Bernd Burgstaller, Bernhard Scholz
IEEE Trans. Parallel Distributed Syst.1
2010 Corona: Energy-Efficient Multi-query Processing in Wireless Sensor Networks
Raymes Khoury, Tim Dawborn, Bulat Gafurov, Glen Pink, Edmund Tse, Quincy Tse, Khaled Almiani, Mohamed Medhat Gaber, Uwe Röhm, Bernhard Scholz
DASFAA (2)1