Sciweavers

5838 search results - page 785 / 1168
» A File System for System Programming in Ubiquitous Computing
Sort
View
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 7 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
CC
2007
Springer
109views System Software» more  CC 2007»
16 years 15 days ago
Layout Transformations for Heap Objects Using Static Access Patterns
As the amount of data used by programs increases due to the growth of hardware storage capacity and computing power, efficient memory usage becomes a key factor for performance. Si...
Jinseong Jeon, Keoncheol Shin, Hwansoo Han
SIGADA
1998
Springer
15 years 10 months ago
Looking into Safety with the Safety and Security Rapporteur Group
The requirements of High Integrity safety-critical, secure and mission-critical Software force developers to use specialised development techniques. Often the choice of computer l...
Stephen Michell, Mark Saaltink, Brian A. Wichmann
PPOPP
2003
ACM
15 years 11 months ago
User-controllable coherence for high performance shared memory multiprocessors
In programming high performance applications, shared address-space platforms are preferable for fine-grained computation, while distributed address-space platforms are more suita...
Collin McCurdy, Charles N. Fischer
OSDI
1994
ACM
15 years 7 months ago
Distributed Filaments: Efficient Fine-Grain Parallelism on a Cluster of Workstations
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...
Vincent W. Freeh, David K. Lowenthal, Gregory R. A...