Sciweavers

3 search results - page 1 / 1
» Minimal blocking sets in PG(2, 9)
Sort
View
ARSCOM
2008
85views more  ARSCOM 2008»
13 years 5 months ago
Minimal blocking sets in PG(2, 9)
We classify the minimal blocking sets of size 15 in PG(2, 9). We show that the only examples are the projective triangle and the sporadic example arising from the secants to the u...
Fernanda Pambianco, Leo Storme
ARSCOM
2008
65views more  ARSCOM 2008»
13 years 5 months ago
On the non-existence of a maximal partial spread of size 76 in PG(3, 9)
We prove the non-existence of maximal partial spreads of size 76 in PG(3, 9). Relying on the classification of the minimal blocking sets of size 15 in PG(2, 9) [22], we show that ...
Olof Heden, Stefano Marcugini, Fernanda Pambianco,...
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
13 years 11 months ago
ASR: Adaptive Selective Replication for CMP Caches
The large working sets of commercial and scientific workloads stress the L2 caches of Chip Multiprocessors (CMPs). Some CMPs use a shared L2 cache to maximize the on-chip cache c...
Bradford M. Beckmann, Michael R. Marty, David A. W...