Search results for "cache"
showing 10 items of 79 documents
Splitting the data cache: a survey
2000
Recent cache-memory research has focused on approaches that split the first-level data cache into two independent subcaches. The authors introduce a methodology for helping cache designers devise splitting schemes and survey a representative set of the published cache schemes.
Signaux qualitatifs et phénomène de star
2000
The superstar phenomenon describes a situation wherein few artists dominate the activity in which they engage and earn significant amounts of money. Most of models, trying to explain this phenomenon, take place clearly on the product market where artists provide ultimate and consumers. We adopt here a different approach by taking place on the labour market regrouping artists (whose the services are production factors) and employers (the producers of cultural products) and we demonstrate that die strategies, consisting in minimizing search costs under contraint of quality maximisation, can work towards explaining the emergence of a very unequal distribution of artistic incomes. In order to m…
LoneStar RAID
2016
The need for huge storage archives rises with the ever growing creation of data. With today’s big data and data analytics applications, some of these huge archives become active in the sense that all stored data can be accessed at any time. Running and evolving these archives is a constant tradeoff between performance, capacity, and price. We present the LoneStar RAID, a disk-based storage architecture, which focuses on high reliability, low energy consumption, and cheap reads. It is designed for MAID systems with up to hundreds of disk drives per server and is optimized for “write once, read sometimes” workloads. We use dedicated data and parity disks, and export the data disks as individu…
Scavenger – A Framework for Efficient Evaluation of Dynamic and Modular Algorithms
2015
Machine Learning methods and algorithms are often highly modular in the sense that they rely on a large number of subalgorithms that are in principle interchangeable. For example, it is often possible to use various kinds of pre- and post-processing and various base classifiers or regressors as components of the same modular approach. We propose a framework, called Scavenger, that allows evaluating whole families of conceptually similar algorithms efficiently. The algorithms are represented as compositions, couplings and products of atomic subalgorithms. This allows partial results to be cached and shared between different instances of a modular algorithm, so that potentially expensive part…
SP660HIGH-VOLUME ON-LINE HEMODIAFILTRATION MAY PREVENT PROTEIN-ENERGY WASTING IN HEMODIALYSIS PATIENTS: A 1-YEAR PROSPECTIVE CONTROLLED STUDY
2018
Computer Structure Laboratory
2019
La asignatura "Estructura de Computadores" es una asignatura obligatoria de segundo curso del Grado en Ingeniería Multimedia y del Grado en Ingeniería Informática. Tiene asignada una dedicación de 6 ECTS, siendo de carácter obligatorio en los dos grados. El material desarrollado son un total de 8 sesiones de laboratorio de 2 horas y media cada una, donde se estudia: jerarquía de memoria, centrándose en la memoria cache (3 sesiones), entrada y salida (2 sesiones) y periféricos (3 sesiones). En las 5 primeras prácticas se utiliza un software (MipsIt) que simula una máquina MIPS. En las 3 últimas sesiones se utiliza una máquina virtual con Linux. Las prácticas parten de ejemplos ya preparados …
Decision-cache based XACML authorisation and anonymisation for XML documents
2012
Author's version of an article in the journal: Computer Standards and Interfaces. Also available from the publisher at: http://dx.doi.org/10.1016/j.csi.2011.10.007 This paper describes a decision cache for the eXtensible Access Control Markup Language (XACML) that supports fine-grained authorisation and anonymisation of XML based messages and documents down to XML attribute and element level. The decision cache is implemented as an XACML obligation service, where a specification of the XML elements to be authorised and anonymised is sent to the Policy Enforcement Point (PEP) during initial authorisation. Further authorisation of individual XML elements according to the authorisation specifi…
Improving Chord Lookup Protocol for P2PSIP-Based Communication Systems
2009
Chord has been suggested as mandatory overlay technology in the future P2PSIP-based communication systems. Chord allows for the available peer/resource lookup in no more than hops, where N is the total number of the peers in the overlay network. However, as a protocol originally designed for background downloading applications, Chord has a few drawbacks when supporting P2PSIP real-time communication systems. These drawbacks are related to ID assignment, the relation between ID and physical location, the routing styles and lack of cache, etc. In this paper, we investigate several approaches that can improve the efficiency of the peer/resource lookup algorithm. After that, we simulate two sys…