- Here is my new poem - 1 Update
- Here is my next poem - 1 Update
- About DelphiConcurrent and FreepascalConcurrent - 1 Update
- Read again, i correct.. - 1 Update
- DelphiConcurrent and FreepascalConcurrent version 0.6 - 2 Updates
- My scalable Adder is here.. - 1 Update
| Horizon68 <horizon@horizon.com>: Jun 26 12:57PM -0700 Hello.. Here is my new poem: I swim with sharks and dolphins But this is not part of my dream Because my way of wisdom has to be seen To be able to appreciate and to redeem As Liberty is not only a dream Since time is also relativity And that is important to satisfiability Because even relativity of time fights the enemy Hence to be Liberty you have to be quality And to be quality you have to be competency And to be competency you have to be responsability Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Jun 25 02:05PM -0700 Hello.. Here is my next poem: I was just listening at the following beautiful Cajun Songs and Music, so i have just decided to write a poem, so i invite you to read it listening at the same at this beautiful Soppsleven's Cajun Mix: https://www.youtube.com/watch?v=hm5QF680FI8 Here is my next poem: As the fruits of the day and night The "insight" is thus coming to us with a delight Because we are knowing more about the evil fight Because we are knowing more how to make a beautiful bright Because we are knowing more how to make a beautiful light Because we are knowing more how to make a beautiful right Because we are knowing more how to beautifully invite Because we are knowing more how to be beautifully polite And that's alright my baby, that's alright ! Since that's also the way to unite ! Since it is like a beautiful flight ! Since it is like the words of the almight ! Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Jun 25 07:45AM -0700 Hello.. About DelphiConcurrent and FreepascalConcurrent: I have just made DelphiConcurrent work correctly with the examples inside the zip file, you can download again DelphiConcurrent and FreepascalConcurrent from: https://sites.google.com/site/scalable68/delphiconcurrent-and-freepascalconcurrent Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Jun 24 05:52PM -0700 Hello.. Read this: My scalable Adder is here.. As you have noticed i have just posted previously my modified versions of DelphiConcurrent and FreepascalConcurrent to deal with deadlocks in parallel programs. But i have just read the following about how to avoid race conditions in Parallel programming in most cases.. Here it is: https://vitaliburkov.wordpress.com/2011/10/28/parallel-programming-with-delphi-part-ii-resolving-race-conditions/ This is why i have invented my following powerful scalable Adder to help you do the same as the above, please take a look at its source code to understand more, here it is: https://sites.google.com/site/scalable68/scalable-adder-for-delphi-and-freepascal Other than that, about composability of lock-based systems now: Design your systems to be composable. Among the more galling claims of the detractors of lock-based systems is the notion that they are somehow uncomposable: "Locks and condition variables do not support modular programming," reads one typically brazen claim, "building large programs by gluing together smaller programs[:] locks make this impossible."9 The claim, of course, is incorrect. For evidence one need only point at the composition of lock-based systems such as databases and operating systems into larger systems that remain entirely unaware of lower-level locking. There are two ways to make lock-based systems completely composable, and each has its own place. First (and most obviously), one can make locking entirely internal to the subsystem. For example, in concurrent operating systems, control never returns to user level with in-kernel locks held; the locks used to implement the system itself are entirely behind the system call interface that constitutes the interface to the system. More generally, this model can work whenever a crisp interface exists between software components: as long as control flow is never returned to the caller with locks held, the subsystem will remain composable. Second (and perhaps counterintuitively), one can achieve concurrency and composability by having no locks whatsoever. In this case, there must be no global subsystem state—subsystem state must be captured in per-instance state, and it must be up to consumers of the subsystem to assure that they do not access their instance in parallel. By leaving locking up to the client of the subsystem, the subsystem itself can be used concurrently by different subsystems and in different contexts. A concrete example of this is the AVL tree implementation used extensively in the Solaris kernel. As with any balanced binary tree, the implementation is sufficiently complex to merit componentization, but by not having any global state, the implementation may be used concurrently by disjoint subsystems—the only constraint is that manipulation of a single AVL tree instance must be serialized. Read more here: https://queue.acm.org/detail.cfm?id=1454462 And about Message Passing Process Communication Model and Shared Memory Process Communication Model: An advantage of shared memory model is that memory communication is faster as compared to the message passing model on the same machine. However, shared memory model may create problems such as synchronization and memory protection that need to be addressed. Message passing's major flaw is the inversion of control–it is a moral equivalent of gotos in un-structured programming (it's about time somebody said that message passing is considered harmful). Also some research shows that the total effort to write an MPI application is significantly higher than that required to write a shared-memory version of it. Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Jun 24 01:08PM -0700 Hello, DelphiConcurrent and FreepascalConcurrent version 0.6 https://sites.google.com/site/scalable68/delphiconcurrent-and-freepascalconcurrent DelphiConcurrent and FreepascalConcurrent by Moualek Adlene is a new way to build Delphi applications which involve parallel executed code based on threads like application servers. DelphiConcurrent provides to the programmers the internal mechanisms to write safer multi-thread code while taking a special care of performance and genericity. In concurrent applications a DEADLOCK may occurs when two threads or more try to lock two consecutive shared resources or more but in a different order. With DelphiConcurrent and FreepascalConcurrent, a DEADLOCK is detected and automatically skipped - before he occurs - and the programmer has an explicit exception describing the multi-thread problem instead of a blocking DEADLOCK which freeze the application with no output log (and perhaps also the linked clients sessions if we talk about an application server). Amine Moulay Ramdane has extended them with the support of his scalable RWLocks for Windows and Linux and with the support of his scalable lock called MLock for Windows and Linux and he has also added the support for a Mutex for Windows and Linux, please look inside the DelphiConcurrent.pas and FreepascalConcurrent.pas files to understand more. And please read the html file inside to learn more how to use it. Language: FPC Pascal v2.2.0+ / Delphi 5+: http://www.freepascal.org/ Required FPC switches: -O3 -Sd -Sd for delphi mode.... Required Delphi XE-XE7 and Tokyo switch: -$H+ -DXE You can configure it as follows from inside defines.inc file: {$DEFINE CPU32} and {$DEFINE Windows32} for 32 bit systems {$DEFINE CPU64} and {$DEFINE Windows64} for 64 bit systems - Platform: Windows and Linux (x86) You can download them from: https://sites.google.com/site/scalable68/delphiconcurrent-and-freepascalconcurrent Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Jun 24 05:43PM -0700 Hello, Read this: DelphiConcurrent and FreepascalConcurrent version 0.6 DelphiConcurrent and FreepascalConcurrent by Moualek Adlene is a new way to build Delphi and Freepascal applications which involve parallel executed code based on threads like application servers. DelphiConcurrent and FreepascalConcurrent provide to the programmers the internal mechanisms to write safer multi-thread code while taking a special care of performance and genericity. In concurrent applications a DEADLOCK may occurs when two threads or more try to lock two consecutive shared resources or more but in a different order. With DelphiConcurrent and FreepascalConcurrent, a DEADLOCK is detected and automatically skipped - before he occurs - and the programmer has an explicit exception describing the multi-thread problem instead of a blocking DEADLOCK which freeze the application with no output log (and perhaps also the linked clients sessions if we talk about an application server). Amine Moulay Ramdane has extended them with the support of his scalable RWLocks for Windows and Linux that are starvation-free and with the support of his scalable lock called MLock for Windows and Linux and he has also added the support for a Mutex for Windows and Linux, please look inside the DelphiConcurrent.pas and FreepascalConcurrent.pas files to understand more. And please read the html file inside to learn more how to use it. Language: FPC Pascal v2.2.0+ / Delphi 5+: http://www.freepascal.org/ Required FPC switches: -O3 -Sd -Sd for delphi mode.... Required Delphi XE-XE7 and Tokyo switch: -$H+ -DXE You can configure it as follows from inside defines.inc file: {$DEFINE CPU32} and {$DEFINE Windows32} for 32 bit systems {$DEFINE CPU64} and {$DEFINE Windows64} for 64 bit systems - Platform: Windows and Linux (x86) You can download them from: https://sites.google.com/site/scalable68/delphiconcurrent-and-freepascalconcurrent Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Jun 24 05:36PM -0700 Hello... My scalable Adder is here.. As you have noticed i have just posted previously my modified versions of DelphiConcurrent and FreepascalConcurrent to deal with deadlocks in parallel programs. But i have just read the following about how to avoid race conditions in Parallel programming in most cases.. Here it is: https://vitaliburkov.wordpress.com/2011/10/28/parallel-programming-with-delphi-part-ii-resolving-race-conditions/ This is why i have invented my following powerful scalable Adder to help you do the same as the above, please take a look at its source code to understand more, here it is: https://vitaliburkov.wordpress.com/2011/10/28/parallel-programming-with-delphi-part-ii-resolving-race-conditions/ Other than that, about composability of lock-based systems now: Design your systems to be composable. Among the more galling claims of the detractors of lock-based systems is the notion that they are somehow uncomposable: "Locks and condition variables do not support modular programming," reads one typically brazen claim, "building large programs by gluing together smaller programs[:] locks make this impossible."9 The claim, of course, is incorrect. For evidence one need only point at the composition of lock-based systems such as databases and operating systems into larger systems that remain entirely unaware of lower-level locking. There are two ways to make lock-based systems completely composable, and each has its own place. First (and most obviously), one can make locking entirely internal to the subsystem. For example, in concurrent operating systems, control never returns to user level with in-kernel locks held; the locks used to implement the system itself are entirely behind the system call interface that constitutes the interface to the system. More generally, this model can work whenever a crisp interface exists between software components: as long as control flow is never returned to the caller with locks held, the subsystem will remain composable. Second (and perhaps counterintuitively), one can achieve concurrency and composability by having no locks whatsoever. In this case, there must be no global subsystem state—subsystem state must be captured in per-instance state, and it must be up to consumers of the subsystem to assure that they do not access their instance in parallel. By leaving locking up to the client of the subsystem, the subsystem itself can be used concurrently by different subsystems and in different contexts. A concrete example of this is the AVL tree implementation used extensively in the Solaris kernel. As with any balanced binary tree, the implementation is sufficiently complex to merit componentization, but by not having any global state, the implementation may be used concurrently by disjoint subsystems—the only constraint is that manipulation of a single AVL tree instance must be serialized. Read more here: https://queue.acm.org/detail.cfm?id=1454462 And about Message Passing Process Communication Model and Shared Memory Process Communication Model: An advantage of shared memory model is that memory communication is faster as compared to the message passing model on the same machine. However, shared memory model may create problems such as synchronization and memory protection that need to be addressed. Message passing's major flaw is the inversion of control–it is a moral equivalent of gotos in un-structured programming (it's about time somebody said that message passing is considered harmful). Also some research shows that the total effort to write an MPI application is significantly higher than that required to write a shared-memory version of it. Thank you, 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