Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 11 years ago.
Improve this question
I've been searching about this on google, but I get a lot of external information like: it is self healing and more stable etc etc..
Can someone explain the internal workings of the two systems, in terms of how they store data, retrieve them and any other differences between them. I gather FAT stores in clusters of bytes and has a "FAT" table to store entries. Also they mention that each cluster has a link to the next. How is FAT working exactly when I poll for a particular file. What happens in NTFS?
Your question is extremely general - so just some links with information about NTFS:
http://msdn.microsoft.com/en-us/library/ms995846.aspx
http://www.ntfs.com/ntfs_vs_fat.htm
http://www.ntfs.com/ntfs_basics.htm
Related
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 5 years ago.
Improve this question
I have few doubts on database storage techniques:
How to store CPU usage activity to consider it for later use?
How to store RAM usage variation for a certain amount of time?
Similarly, how to store Disk usage?
All these data will be later used for ANOVA test.
I am trying to get these values from a c# application which will be monitoring the activities of a system for a certain amount of time.
A much better idea is to use the Performance Manager built into Windows (perfmon.exe). You can set it to record many performance items including the three you mention (CPU and RAM by program as well as in total). There is also a free analyser called PAL at Codeplex which can help you set the recording and then analyse it for you.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Closed 9 years ago.
Improve this question
I have a practice room with a LAN. It is common for student to do exercises. A student create some files on a computer and I want:
- He/She can't see files of others.
- He/She can continue to work on his/her files.
I think this suits to a FTP server. But which fpt server can support over 3000 clients?
Or is there an alternative for this problem?
Thanks.
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 10 years ago.
Improve this question
I want to use ARMCI, I try to read its documentation,
what I understand is that ARMCI is not used by developers but by a library.
This means that there can be different implementation of ARMCI as MPI do.
Can some one please suggest me some of those implemeations.
In general, I am unable to get started with ARMCI (speaking of the coding),
any help will be appreciated.
You could use ARMCI directly, but it is a low-level interface. Global Arrays (GA) is probably the most popular library based on ARMCI. GA is used by NWChem, among others.
There are multiple implementations of ARMCI. The one from Pacific Northwest can be downloaded as part of the GA package. There is also an implementation of ARMCI in new versions of MPICH2 that works over MPI one-sided operations.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 9 years ago.
Improve this question
Anybody used Neural Network approaches for clustering data? Particularly
ART Neural Network (Adaptive Resonance Theory) or
Kohonen self organizing maps
How are they as compared to k-means or any other distance based clustering Algorithms?
Self-organizing maps (SOMs) have some internal similarities with K-Means, but also important differences. A SOM actually maps your data from the original data space (usually high-dimensional) onto the map space (usually two-dimensional), while trying to preserve the original data densities and neighborhood relationships. It won't give you directly the clustering, but may help you to visually inspect the data and recognize clusters.
I know too little about ART nets.
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 11 years ago.
Improve this question
Is it a custom database, or are they using a 'classic' triple store ?
Chasing some old posts, I found this message on their board, followed by this response to a query directed at the developer mentioned in the first message.
While I doubt the developer's response is the mentioned 'long post' of the first, it notes:
"We have written our own graph database on top of Unix. We don't have an RDBMS or OODB storage layer because conventional databases don't handle the volume of self-joins that graph queries generate. Persistence is via memory mapped files with our own transaction manager, custom tailored to provide exactly the (minimal) ACID requirements that we have."
So unless freebase.com have changed their back end tools since Jan '08, it's a custom database.