1017 search results - page 13 / 204 » Register computations on ordinals |
PODC
1990
ACM
13 years 11 months ago
1990
ACM
We introduce a shared data object, called a composite register, that generalizes the notion of an atomic register. A composite register is an array-like shared data object that is...
LICS
2012
IEEE
11 years 10 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
IEEEPACT
2003
IEEE
14 years 27 days ago
2003
IEEE
This paper discusses a register bank assignment problem for a popular network processor--Intel's IXP. Due to limited data paths, the network processor has a restriction that ...
ICCS
2001
Springer
14 years 2 days ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
ASAP
2003
IEEE
14 years 28 days ago
2003
IEEE