2300 search results - page 356 / 460 » Maximally Concurrent Programs |
120
click to vote
IEEEPACT
2002
IEEE
15 years 7 months ago
2002
IEEE
Traditional compilers perform their code generation tasks based on a fixed, pre-determined instruction set. This paper describes the implementation of a compiler that determines ...
129
click to vote
PDP
2002
IEEE
15 years 7 months ago
2002
IEEE
Despite the explosive new interest in Distributed Computing, bringing software — particularly legacy software — to parallel platforms remains a daunting task. The Self Distrib...
130
click to vote
VTS
2002
IEEE
15 years 7 months ago
2002
IEEE
We present a software-based weighted random pattern scheme for testing delay faults in IP cores of programmable SoCs. We describe a method for determining static and transition pr...
117
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
139
click to vote
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...