- Neural Networks and Deep Learning - 1 Update
- I correct some typos, please read again - 1 Update
- About my Distributed sequential lock algorithm - 1 Update
- My next projects and algorithms - 1 Update
| Ramine <ramine@1.1>: Jan 30 05:22PM -0800 Hello, If you want to learn easily about what is Deep Learning in artificiel intelligence , please read the following book , i have just read it and it is a good book: Read it from here: http://neuralnetworksanddeeplearning.com/index.html Amine Moulay Ramdane. |
| Ramine <ramine@1.1>: Jan 30 05:15PM -0800 I correct some typos , please read again... Hello, I want to clear something about my Distributed sequential lock algorithm, you can download it and read about it here: https://sites.google.com/site/aminer68/scalable-distributed-sequential-lock If you read carefully the source code you will notice that i am using this: "myid3:=FCount6^.fcount6;" inside the RLock() method in the reader side, so when my algorithm switches from a Seqlock mode to a Distributed lock mode, the "myid3:=FCount6^.fcount6;" will be "serialized" when the writer side increment FCount6^.fcount6, so in the writer side i am calling the distributed reader-writer lock when the algorithm switches to a Distributed mode, so if you have noticed since the "myid3:=FCount6^.fcount6;" is serialized in the reader side when "FCount6^.fcount6" is incremented in the writer side, so this will look like a probabilistic mechanism cause the reader side is serializing the the transfer of FCount6^.fcount6 on the bus, and the writer side is serializing the transfer of a variable in the bus also when it is calling the WLock() of the distributed lock, so this is a kind of a probabilistic mechanism cause this can generate contention and the reader side can call RLock() on a distributed lock's reader-writer mutex that is entered before the reader by the writer, but even though it is a probabilistic mechanism, this probabilistic mechanism will give a good result and it eliminates the "livelock" situation of the Seqlock when there is more writers. Thank you for your time. Amine Moulay Ramdane. |
| Ramine <ramine@1.1>: Jan 30 04:21PM -0800 Hello, I want to clear something about my Distributed sequential lock algorithm, you can download it and read about it here: https://sites.google.com/site/aminer68/scalable-distributed-sequential-lock If you read carefully the source code you will noticed that i am using this: "myid3:=FCount6^.fcount6;" inside the RLock() method in the reader side, so when my algorithms switches from a Seqlock mode to a Distributed lock mode, the "myid3:=FCount6^.fcount6;" will be "serialized" when the writer side increment FCount6^.fcount6, so in the writer side i am calling the distributed reader-writer lock when the algorithm swithes to a Distributed mode, so if you have noticed since the "myid3:=FCount6^.fcount6;" is serialized in the reader side when "FCount6^.fcount6" is incremented in the writer side, so this will look like a probalistic mechanism cause the reader side is serializing the the transfer of FCount6^.fcount6 on the bus, and the writer side is serializing the transfer of a variable in the bus also when it is calling the WLock() of the distributed lock, so this is a kind of a probalistic mechanism cause this can generate contention and the reader side can call RLock() on a distributed lock's reader-writer mutex that is entered before the reader by the writer, but even though it is a probalistic mechanism, this probabilistic mechanism will give a good result and it eliminates the "livelock" situation of the Seqlock when there is more writers. Thank you for your time. Amine Moulay Ramdane. |
| Ramine <ramine@1.1>: Jan 30 03:48PM -0800 Hello, I was thinking about my next projects and algorithms... And here is what i am thinking to implement: As you have noticed i have implemented my Parallel archiver, you can download it and read about it here: https://sites.google.com/site/aminer68/parallel-archiver I was thinking more and more and i think my Parallel archiver can be used as a base to implement a parallel file system and parallel database system... How my Parallel archiver can be used to imoplement a parallel file system ? Look at my parallel archiver i am storing the paths's names of my files inside the Parallel archiver's archive, and this is useful cause i can use AVL trees and use my Parallel archiver to implement a parallel file system, for example if i have two paths's names such as "/amine/products/cpu" and "/amine/products/motherboards", i can split the paths and store the directory called "amine" inside an in-memory AVL tree, and i can store the second directory called "products" inside the parent's "amine" AVL tree, and i can store the "cpu" and "motherboards" directories inside the parent's "products" AVL tree, this way it will be easy to implement a parallel file system and the files of the file system will be stored inside the hardisk archiver and it will be access in O(1) time complexity and the directories's names and the files's names will be stored inside the in-memory AVL trees and they will be accessed in log(n) time complexity, and of course i will use my Distributed sequential lock in each AVL tree etc. this is my new idea to implement a file system using my Parallel archiver. I can extend this idea of a parallel file system using my Parallel archiver to implement also a parallel database system, all i have to do is implement indexed tables and and there more complex operations and this is easy to do, i have just to store for example the files inside the "cpu" directory that contains the index that is "cpu frequency" inside another AVL tree so that you can use an SQL statement to query the index that is "cpu frequency", the tables's names that will be indexed will be stored for example inside a hashtable so that it will be accessed very fast, and this is how i will implement a database system using my Parallel archiver and by extending the idea of implementing a parallel file system using my Parallel archiver, and of course the database system will be a parallel database system using my Distributed sequentiel lock in each AVL trees etc. Finally as you have noticed this is my new ideas of my next projects that i will implement if i have more time to do it. Thank you for your time. Amine Moulay Ramdane. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment