Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,358,048 papers from all fields of science
Search
Sign In
Create Free Account
Distributed File System (Microsoft)
Known as:
DFS Namespaces
, DFS
, Microsoft Distributed File System
Expand
Distributed file System (DFS) is a set of client and server services that allow an organization using Microsoft Windows servers to organize many…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Active Directory
Clustered file system
DCE Distributed File System
Failover
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A DVFS Cycle Accurate Simulation Framework with Asynchronous NoC Design for Power-Performance Optimizations
Davide Zoni
,
F. Terraneo
,
W. Fornaciari
Journal of Signal Processing Systems
2015
Corpus ID: 9369243
Network-on-Chip (NoC) is a flexible and scalable solution to interconnect multi-cores, with a strong influence on the performance…
Expand
2012
2012
Virtual reservation scheme for supporting CBR multimedia services with strict QoS performance over WLAN and wireless mesh
R. Ohayon
International Journal of Communication Systems
2012
Corpus ID: 31377622
Carrier sense multiple access and its variants have been widely used in mobile ad hoc networks. However, most existing access…
Expand
2011
2011
On oral health in young individuals with foreign and Swedish backgrounds
B. Jacobsson
2011
Corpus ID: 70715617
In Sweden, children and adolescents with two foreign-born parents constitute 17% of all children in the Swedish population.AIMS…
Expand
2010
2010
New channel allocation techniques for power efficient WiFi networks
Vasileios Miliotis
,
A. Apostolaras
,
T. Korakis
,
Zhifeng Tao
,
L. Tassiulas
IEEE International Symposium on Personal, Indoor…
2010
Corpus ID: 2476929
Energy efficiency becomes evergreen than ever before. Over the last few years a significant research in wireless communications…
Expand
2007
2007
Finding multi-constrained path using genetic algorithm
S. Yussof
,
O. See
IEEE International Conference on…
2007
Corpus ID: 30264762
To properly support networked multimedia applications, it is important for the network to provide quality-of- service (QoS…
Expand
2007
2007
A Differentiated Service Model for Enhanced Distributed Channel Access (EDCA) of IEEE 802.11e WLANs
Jeng-Farn Lee
,
W. Liao
,
Meng Chang Chen
Mob. Networks Appl.
2007
Corpus ID: 6344936
In this paper, we propose a new differentiated service model, referred to as Differentiated Service-EDCA (DS-EDCA), for the…
Expand
2006
2006
Intercalation of Diphenyl Sulfide into Nanogalleries and Preparation of Poly(p‐phenylenesulfide)‐Based Nanocomposites
Tomotaka Saito
,
M. Okamoto
,
R. Hiroi
,
Minoru Yamamoto
,
Takashi Shiroi
2006
Corpus ID: 53417182
For the reference system of PPS-based nanocomposites, we investigated the intercalation behavior of DFS molecules into nano…
Expand
2002
2002
Improving the efficiency of circuit-to-BDD conversion by gate and input ordering
F. Aloul
,
I. Markov
,
K. Sakallah
Proceedings. IEEE International Conference on…
2002
Corpus ID: 7175717
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean…
Expand
2001
2001
Rückgang der Kariesprävalenz bei Schweizer Rekruten von 1970 bis 1996
G. Menghini
,
M. Steiner
,
T. Marthaler
,
R. Weber
2001
Corpus ID: 133019292
DEUTSCH: 1996 wurden in Thun 416 Rekruten (20,4-jahrig) zahnmedizinisch untersucht. Der durchschnittliche klinisch-visuell…
Expand
1990
1990
The Ficus Distributed File System : Replication via Stackable Layers
T. Page
,
G. Popek
,
Richard G. Guy
,
J. Heidemann
1990
Corpus ID: 6146765
Selective le replication is a key component of any highly reliable, large scale distributed le system. This paper describes the…
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