Sciweavers

2019 search results - page 116 / 404
» Programming with Shared Data Abstractions
Sort
View
ICCS
2001
Springer
15 years 2 months ago
Achieving Performance Portability with SKaMPI for High-Performance MPI Programs
Abstract. Current development processes for parallel software often fail to deliver portable software. This is because these processes usually require a tedious tuning phase to del...
Ralf Reussner, Gunnar Hunzelmann
IPPS
2008
IEEE
15 years 4 months ago
A transparent non-invasive file data model for algorithmic skeletons
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...
Denis Caromel, Mario Leyton
TCSB
2008
14 years 9 months ago
Robustness to Code and Data Deletion in Autocatalytic Quines
Abstract. Software systems nowadays are becoming increasingly complex and vulnerable to all sorts of failures and attacks. There is a rising need for robust self-repairing systems ...
Thomas Meyer, Daniel Schreckling, Christian F. Tsc...
ITA
2007
153views Communications» more  ITA 2007»
14 years 9 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
TCOM
2011
129views more  TCOM 2011»
14 years 4 months ago
On the Capacity of WDM Passive Optical Networks
—To lower costs, WDM PONs may share the usage of wavelengths, transmitters, and receivers among ONUs, instead of dedicating the transmission between OLT and each ONU with one ind...
Jingjing Zhang, Nirwan Ansari