Sciweavers

1024 search results - page 135 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
PLDI
2006
ACM
15 years 8 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann
DOCENG
2003
ACM
15 years 7 months ago
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
Jean-Yves Vion-Dury
ISCA
1998
IEEE
114views Hardware» more  ISCA 1998»
15 years 6 months ago
Tempest and Typhoon: User-Level Shared Memory
Future parallel computers must efficiently execute not only hand-coded applications but also programs written in high-level, parallel programming languages. Today's machines ...
Steven K. Reinhardt, James R. Larus, David A. Wood
WCE
2007
15 years 3 months ago
Sparse Matrix Multiplication Using UPC
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...
Hoda El-Sayed, Eric Wright
CORR
2008
Springer
185views Education» more  CORR 2008»
15 years 2 months ago
Realizing Fast, Scalable and Reliable Scientific Computations in Grid Environments
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
Yong Zhao, Ioan Raicu, Ian T. Foster, Mihael Hateg...