Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
24,464
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that move-to-front is within a constant factor of optimum amo ..."
Abstract
-
Cited by 824 (8 self)
- Add to MetaCart
among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and frequency count rules, da not share this property. We generalize our results to show that move-to-front is within a constant factor of optimum as long as the access cost is a convex function. We also study
The R*-tree: an efficient and robust access method for points and rectangles
- INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1990
"... The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the ..."
Abstract
-
Cited by 1262 (74 self)
- Add to MetaCart
The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design
Job Creation and Destruction
, 1996
"... With unemployment at historically high levels in many OECD countries, increased job creation has risen to the top of the policy agenda for many western governments-but how can this be achieved? The importance of job creation (and destruction) in an economy cannot be overstated. Labour is organized a ..."
Abstract
-
Cited by 909 (68 self)
- Add to MetaCart
in recent years. Fur-thermore, job destruction can lead to involuntary worker separations and possibly substantial adjustment costs for individuals. This well-written book assembles much of the empirical work written on job creation and destruction. It is well laid out and accessible to both specialists
The SGI Origin: A ccNUMA highly scalable server
- In Proceedings of the 24th International Symposium on Computer Architecture (ISCA’97
, 1997
"... The SGI Origin 2000 is a cache-coherent non-uniform memory access (ccNUMA) multiprocessor designed and manufactured by Silicon Graphics, Inc. The Origin system was designed from the ground up as a multiprocessor capable of scaling to both small and large processor counts without any bandwidth, laten ..."
Abstract
-
Cited by 497 (0 self)
- Add to MetaCart
The SGI Origin 2000 is a cache-coherent non-uniform memory access (ccNUMA) multiprocessor designed and manufactured by Silicon Graphics, Inc. The Origin system was designed from the ground up as a multiprocessor capable of scaling to both small and large processor counts without any bandwidth
Cluster Ensembles - A Knowledge Reuse Framework for Combining Multiple Partitions
- Journal of Machine Learning Research
, 2002
"... This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse&ap ..."
Abstract
-
Cited by 603 (20 self)
- Add to MetaCart
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse
A Hierarchical Internet Object Cache
- IN PROCEEDINGS OF THE 1996 USENIX TECHNICAL CONFERENCE
, 1995
"... This paper discusses the design andperformance of a hierarchical proxy-cache designed to make Internet information systems scale better. The design was motivated by our earlier trace-driven simulation study of Internet traffic. We believe that the conventional wisdom, that the benefits of hierarch ..."
Abstract
-
Cited by 496 (6 self)
- Add to MetaCart
of hierarchical file caching do not merit the costs, warrants reconsideration in the Internet environment. The cache implementation supports a highly concurrent stream of requests. We present performance measurements that show that the cache outperforms other popular Internet cache implementations by an order
RESEARCH Open Access Cost
"... effectiveness of lanthanum carbonate in chronic kidney disease patients in Spain before and during dialysis ..."
Abstract
- Add to MetaCart
effectiveness of lanthanum carbonate in chronic kidney disease patients in Spain before and during dialysis
Strategies for Searching with Different Access Costs
"... . Let us consider an ordered set of elements A = fa1 ! \Delta \Delta \Delta ! ang and a list of positive costs c1 ; : : : ; cn , where c i is the access cost of the element a i . Any search strategy for the set A can be represented by a binary search tree (BST) with n nodes, where each node corre ..."
Abstract
- Add to MetaCart
. Let us consider an ordered set of elements A = fa1 ! \Delta \Delta \Delta ! ang and a list of positive costs c1 ; : : : ; cn , where c i is the access cost of the element a i . Any search strategy for the set A can be represented by a binary search tree (BST) with n nodes, where each node
Nimrod/G: An architecture for a resource management and scheduling system in a global computational Grid
- PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING IN ASIA-PACIFIC REGION (HPC ASIA 2000)
, 2000
"... Abstract- The availability of powerful microprocessors and high-speed networks as commodity components has enabled high performance computing on distributed systems (wide-area cluster computing). In this environment, as the resources are usually distributed geographically at various levels (departme ..."
Abstract
-
Cited by 406 (70 self)
- Add to MetaCart
(department, enterprise, or worldwide) there is a great challenge in integrating, coordinating and presenting them as a single resource to the user; thus forming a computational grid. Another challenge comes from the distributed ownership of resources with each resource having its own access policy, cost
Informed Prefetching and Caching
- In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles
, 1995
"... The underutilization of disk parallelism and file cache buffers by traditional file systems induces I/O stall time that degrades the performance of modern microprocessor-based systems. In this paper, we present aggressive mechanisms that tailor file system resource management to the needs of I/O-int ..."
Abstract
-
Cited by 402 (10 self)
- Add to MetaCart
accesses. Our approach estimates the impact of alternative buffer allocations on application execution time and applies a cost-benefit analysis to allocate buffers where they will have the greatest impact. We implemented informed prefetching and caching in DEC’s OSF/1 operating system and measured its
Results 1 - 10
of
24,464
