Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 222,879,403 papers from all fields of science
Search
Sign In
Create Free Account
User space
Known as:
User-space
, Kernel space
, Userland (computing)
Expand
A modern computer operating system usually segregates virtual memory into kernel space and user space. Primarily, this separation serves to provide…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
3 GB barrier
ARM architecture
Address space
BIOS
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Scheduling support for transactional memory contention management
Walther Maldonado
,
P. Marlier
,
+5 authors
Gilles Muller
ACM SIGPLAN Symposium on Principles & Practice of…
2010
Corpus ID: 7895950
Transactional Memory (TM) is considered as one of the most promising paradigms for developing concurrent applications. TM has…
Expand
Highly Cited
2008
Highly Cited
2008
MRI brain image segmentation and bias field correction based on fast spatially constrained kernel clustering approach
Liang Liao
,
Tusheng Lin
,
Bi Li
Pattern Recognition Letters
2008
Corpus ID: 19165463
Highly Cited
2006
Highly Cited
2006
Supporting Integrated MAC and PHY Software Development for the USRP SDR
R. Dhar
,
Gesly George
,
Amit Malani
,
P. Steenkiste
1st IEEE Workshop on Networking Technologies for…
2006
Corpus ID: 7339868
Software Defined Radios (SDR) offer great runtime flexibility both at the physical and MAC layer. This makes them an attractive…
Expand
Highly Cited
2004
Highly Cited
2004
Null Space Approach of Fisher Discriminant Analysis for Face Recognition
Wei Liu
,
Yunhong Wang
,
S. Li
,
T. Tan
ECCV Workshop BioAW
2004
Corpus ID: 8440116
The null space of the within-class scatter matrix is found to express most discriminative information for the small sample size…
Expand
Highly Cited
2002
Highly Cited
2002
Scheduling tasks with mixed preemption relations for robustness to timing faults
J. Regehr
23rd IEEE Real-Time Systems Symposium, . RTSS .
2002
Corpus ID: 1006097
This paper introduces and shows how to schedule two novel scheduling abstractions that overcome limitations of existing work on…
Expand
Highly Cited
1998
Highly Cited
1998
Efficient layering for high speed communication: Fast Messages 2.x
Mario Lauria
,
S. Pakin
,
A. Chien
Proceedings. The Seventh International Symposium…
1998
Corpus ID: 15323563
The authors describe their experience designing, implementing, and evaluating two generations of the high performance…
Expand
Highly Cited
1995
Highly Cited
1995
Design, implementation, and evaluation of a software-based real-time Ethernet protocol
C. Venkatramani
,
T. Chiueh
Conference on Applications, Technologies…
1995
Corpus ID: 2891215
Distributed multimedia applications require performance guarantees from the underlying network subsystem. Ethernet has been the…
Expand
Highly Cited
1994
Highly Cited
1994
Low-latency communication over ATM networks using active messages
T. V. Eicken
,
A. Basu
,
Vineet Buch
Symposium Record Hot Interconnects II
1994
Corpus ID: 17865290
Recent developments in communication architectures for parallel machines have made significant progress and reduced the…
Expand
Highly Cited
1993
Highly Cited
1993
Light-weight process groups in the Isis system
Bradford B. Glade
,
K. Birman
,
R. Cooper
,
R. V. Renesse
Distributed Syst. Eng.
1993
Corpus ID: 16853455
Isis is a toolkit for building applications consisting of cooperating processes in a distributed system. Group management and…
Expand
Review
1982
Review
1982
Interactive Editing Systems: Part I
N. Meyrowitz
,
A. V. Dam
CSUR
1982
Corpus ID: 16643107
Many daily tasks, whether done with conventional tools or with computers, can be wowed as editing tasks: tasks in which the state…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE