Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mark Spear

dblp:25/11042 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 87% Parallel and multicore computing · 13%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Operating systems › resource management › memory management
cache management
0.212013
Whose cache line is it anyway?: operating system support for live detection and repair of false sharing · EuroSys 2013
Memory systems
cache coherence
0.212013
Whose cache line is it anyway?: operating system support for live detection and repair of false sharing · EuroSys 2013
Memory systems › cache coherence
false sharing
0.212013
Whose cache line is it anyway?: operating system support for live detection and repair of false sharing · EuroSys 2013
Parallel and multicore computing › parallel programming models
shared-memory parallelization
0.012013
Whose cache line is it anyway?: operating system support for live detection and repair of false sharing · EuroSys 2013

Methods — techniques the papers use, named apart from their topics

runtime repair · 0.3live detection · 0.3
YearPublicationVenuePosition
2013 Tolerating business failures in hosted applications
abstract
Users of hosted web-based applications implicitly trust that those applications, and the data that is within them, will remain active and available indefinitely into the future. When a service is terminated, for reasons such as the insolvency of the business that is providing it, users risk the immediate loss of software functionality and may face the permanent loss of their own data. This paper presents Micasa, a runtime for hosted applications that allows a significant subset of application logic and user data to remain available even in the event of the failure of a provider's business. By allowing users to audit application dependence on hosted components, and maintain externalized and private copies of their own data and the logic that allows access to it, we believe that Micasa is a first step in the direction of a more balanced degree of trust and investment between application providers and their users.
Jean-Sébastien Légaré, Dutch T. Meyer, Mark Spear, Alexandru Totolici, Sara Bainbridge, Kalan MacRow, Róbert Sumi, Quinlan Jung, Dennis Tjandra, David Williams-King, William Aiello, Andy Warfield
SoCC3
2013 Whose cache line is it anyway?: operating system support for live detection and repair of false sharing
abstract
As hardware parallelism continues to increase, CPU caches can no longer be considered as a transparent, hardware-level performance optimization. Cache impact on performance, in particular in the face of false sharing, is completely dependent on the software that is executing. To effectively support parallel workloads on cache coherent hardware, the operating system must begin to treat the CPU cache like other shared hardware resources, and manage it appropriately.
Mihir Nanavati, Mark Spear, Nathan Taylor, Shriram Rajagopalan, Dutch T. Meyer, William Aiello, Andy Warfield
EuroSys2
2012 Execution mining
abstract
Operating systems represent large pieces of complex software that are carefully tested and broadly deployed. Despite this, developers frequently have little more than their source code to understand how they behave. This static representation of a system results in limited insight into execution dynamics, such as what code is important, how data flows through a system, or how threads interact with one another. We describe Tralfamadore, a system that preserves complete traces of machine execution as an artifact that can be queried and analyzed with a library of simple, reusable operators, making it easy to develop and run new dynamic analyses. We demonstrate the benefits of this approach with several example applications, including a novel unified source and execution browser.
Geoffrey Lefebvre, Brendan Cully, Christopher Head, Mark Spear, Norman C. Hutchinson, Michael J. Feeley, Andy Warfield
VEE4
2011 Exposing File System Mappings with MapFS
Jake Wires, Mark Spear, Andy Warfield
HotStorage2