Sciweavers

2019 search results - page 170 / 404
» Programming with Shared Data Abstractions
Sort
View
POPL
2007
ACM
16 years 3 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
SIGMETRICS
2009
ACM
126views Hardware» more  SIGMETRICS 2009»
15 years 9 months ago
Self-adaptive admission control policies for resource-sharing systems
We consider the problem of admission control in resource sharing systems, such as web servers and transaction processing systems, when the job size distribution has high variabili...
Varun Gupta, Mor Harchol-Balter
ICPP
1993
IEEE
15 years 7 months ago
Scalability Study of the KSR-1
Scalability of parallel architectures is an interesting area of current research. Shared memory parallel programming is attractive stemming from its relative ease in transitioning...
Umakishore Ramachandran, Gautam Shah, Ravi Kumar, ...
ISCA
2000
IEEE
78views Hardware» more  ISCA 2000»
15 years 7 months ago
On the value locality of store instructions
Value locality, a recently discovered program attribute that describes the likelihood of the recurrence of previously-seen program values, has been studied enthusiastically in the...
Kevin M. Lepak, Mikko H. Lipasti
SEMWEB
2007
Springer
15 years 9 months ago
Unlocking the Potential of Public Sector Information with Semantic Web Technology
Abstract. Governments often hold very rich data and whilst much of this information is published and available for re-use by others, it is often trapped by poor data structures, lo...
Harith Alani, David Dupplaw, John Sheridan, Kieron...