Sciweavers

230 search results - page 27 / 46
» Towards automatic program partitioning
Sort
View
IPPS
2007
IEEE
14 years 5 months ago
A global address space framework for locality aware scheduling of block-sparse computations
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
FPGA
2005
ACM
158views FPGA» more  FPGA 2005»
14 years 4 months ago
Automated synthesis for asynchronous FPGAs
We present an automatic logic synthesis method targeted for highperformance asynchronous FPGA (AFPGA) architectures. Our method transforms sequential programs as well as high-leve...
Song Peng, David Fang, John Teifel, Rajit Manohar
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 9 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
FCCM
2008
IEEE
212views VLSI» more  FCCM 2008»
14 years 5 months ago
Map-reduce as a Programming Model for Custom Computing Machines
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...
Jackson H. C. Yeung, C. C. Tsang, Kuen Hung Tsoi, ...
MODELS
2009
Springer
14 years 5 months ago
Towards systematic ensuring well-formedness of software product lines
Variability modelling with feature models is one key technique for specifying the problem space of software product lines (SPLs). To allow for the automatic derivation of a concre...
Florian Heidenreich