Sciweavers

1960 search results - page 300 / 392
» The Logic of Large Enough
Sort
View
RTAS
2011
IEEE
13 years 1 months ago
Virtual-CPU Scheduling in the Quest Operating System
This paper describes the scheduling framework for a new operating system called “Quest”. The three main goals of Quest are to ensure safety, predictability and efficiency of ...
Matthew Danish, Ye Li, Richard West
BMCBI
2011
13 years 1 months ago
A user-friendly web portal for T-Coffee on supercomputers
Background: Parallel T-Coffee (PTC) was the first parallel implementation of the T-Coffee multiple sequence alignment tool. It is based on MPI and RMA mechanisms. Its purpose is t...
Josep Rius Torrento, Fernando Cores, Francesc Sols...
FAST
2011
13 years 1 months ago
FastScale: Accelerate RAID Scaling by Minimizing Data Migration
Previous approaches to RAID scaling either require a very large amount of data to be migrated, or cannot tolerate multiple disk additions without resulting in disk imbalance. In t...
Weimin Zheng, Guangyan Zhang
IWMM
2011
Springer
245views Hardware» more  IWMM 2011»
13 years 1 months ago
Waste not, want not: resource-based garbage collection in a shared environment
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
Matthew Hertz, Stephen Kane, Elizabeth Keudel, Ton...
ASPLOS
2012
ACM
12 years 5 months ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...