Hello,

More of my philosophy about Superpascal and about CSP(Communicating sequential processes) and more..

I am a white arab from Morocco, and i think i am smart since i have also
invented many scalable algorithms and algorithms..

I think i am smart, and i am also programming in Object Pascal
of Delphi and Freepascal, and i think i am also a smart "Wirthian" programmer of the Wirthian familly of ALGOL-like languages, since i have programmed in Pascal and i have also programmed in Superpascal(You can read about it here: https://en.wikipedia.org/wiki/SuperPascal), and
i have programmed in Object Pascal of Delphi and Freepascal, and i know more about Superpascal, that was an interesting enhancement of the pascal language, that brought an enhanced in a form of a "Forall" statement that is like a Parallel For loop, and that brought an
enhancement in a form of "Channels" that look like Go channels and that permit to code parallel programs, so the Superpascal channels allowed us to program like in CSP(Communicating sequential processes) that is a formal language for describing patterns of interaction in concurrent systems. And CSP(Communicating sequential processes) is a member of the family of mathematical theories of concurrency known as process algebras, or process calculi, based on message passing via channels, so Superpascal Channels allowed us to avoid parallel bugs such as race conditions, but i think that those channels can also be used in a more simple way like in the following article, so that they permit to avoid race conditions and that's also i think a much better enhancement, so read the following article so that to know about the more simple way of using Go channels or Superpascal channels so that to avoid race conditions:

https://fodor.org/blog/go-avoiding-race-conditions/

And so that you get an idea about Superpascal, you can look
at its source code in Freepascal here in Gitub:

https://github.com/octonion/superpascal

So as you notice that Superpascal programming language, that was invented in year 1993, has preceded Go programming language by providing Channels etc.. that permit to do parallel programming by avoiding race conditions and such parallel programming bugs.

But you have to know that i am smart and i have also enhanced
Object Pascal of Freepascal and Delphi by inventing the following
Threadpool that scales well and that supports parallel for loop,
you can read about it carefully here in my websites:

https://sites.google.com/site/scalable68/an-efficient-threadpool-engine-with-priorities-that-scales-very-well

And i have also enhanced Object Pascal of Freepascal and Delphi by
inventing a Scalable reference counting with efficient support for weak references, you can take a look carefully about it here in my websites:

https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references

So as you notice that i am also an inventor of many scalable algorithms
and algorithms..

More of my philosophy about stack memory allocations and about preemptive and non-preemptive timesharing..

I think i am smart, and as you are noticing in my below thoughts that
i am abstracting smartly so that to make you understand preemptive and non-preemptive timesharing , other than that i will also give you
an interesting Stack memory allocation algorithm in Delphi and Freepascal so that to use it smartly with my below sophisticated Stackful coroutines Library, so i will extend my sophisticated Stackful coroutines Library so that to support it smartly, and here it is:

--

var pool: array [1..limit] of integer;
memory: array [min..max] of integer;
top: integer;

procedure initialize;

var index: integer;

begin
for index := 1 to limit do
pool[index] := empty;
top := min − 1
end;

procedure allocate( index, length: integer; var address: integer);

begin

address := pool[index];
if address <> empty then
pool[index] := memory[address]
else
begin
address := top + 1;
top := top + length;
if not (top <= max)
then raise Exception.Create('Stack overflow..')

end
end;

procedure release( index, address: integer);
begin
memory[address] := pool[index];
pool[index] := address
end;

--

More of my philosophy about about the paper and about preemptive and non-preemptive timesharing and more..

I have just forgotten to post about who has written the following
paper about cooperative and preemptive tasking:

https://users.ece.cmu.edu/~koopman/pubs/koopman90_HeavyweightTasking.pdf

Here is the Professor Phil Koopman of Carnegie Mellon University from Department of Electrical and Computer Engineering who has written
this paper:

https://users.ece.cmu.edu/~koopman/personal.html

And note that i am calling, in my thoughts below, cooperative and preemptive tasking: "preemptive and non-preemptive timesharing"

More of my philosophy about Intel 8051 controller and about preemptive and non-preemptive timesharing and more..

I have just quickly read the following interesting paper and it says
that judicious use of cooperative tasking techniques can also often meet an embedded system's multitasking requirements, while giving better
performance and a simpler software environment than a preemptive multitasker, so read it carefully here:

https://users.ece.cmu.edu/~koopman/pubs/koopman90_HeavyweightTasking.pdf

And notice that it also says in the above paper that so that to meet
the requirements with cooperative multitasking you have to move the time-critical code to interrupt-service routines. And let us look
for example at the Intel 8051 controller here:

https://www.electronicwings.com/8051/introduction-to-8051-controller

So as you notice that it has many hardware interrupts that you can
use so that to make the cooperative tasking efficient, and i think it also comes with two clock timers interrupts that you can use to implement preemptive multitasking if you want, and you have also to know about interrupt latency when programming embedded systems with hardware controllers, and you have to know that the hardware interrupts have to get serviced fast enough and often enough, so you shouldn't disable
interrupts for too long a period of time, and just to give you an idea
, look for example at the nonbuffered communication UART (Universal
Asynchronous Receiver Transmitter) operating at 38,400 bits per second will interrupt every 208 microseconds. This is 1/38,400*8 because they
will interrupt for every byte (8 bits), and a processor or controller running at 25MHz executes most of its instructions in
2 or 3 system-clock periods. That would be an average of 120 nanoseconds
(1/25,000,000*3). In theory, this means you could execute as
many as 1,730 instructions in the interrupt interval. So that was only
in theory, now you have to do the reality check. You must take into
consideration that there are more interrupts than just that communication channel. The timer interrupt will be firing off every so often. And the communication interrupt itself will have interrupts
disabled for good period of time, and not only that, but there is also the tasks switch that can be expensive, so you have to think about
it efficiently.

So i invite you to read my below thoughts about preemptive and non-preemptive timesharing and more so that to understand much more efficiently:

More of my philosophy about preemptive and non-preemptive timesharing and more..

I have just took a smart look at Modula-2 language(Modula-2 is a structured, procedural programming language developed between 1977 and 1985 by Niklaus Wirth at ETH Zurich, and he has also developed Pascal
language, read about Niklaus Wirth here: https://en.wikipedia.org/wiki/Niklaus_Wirth), and i think Modula-2 language was among the first languages that has provided preemptive and non-preemptive timesharing with coroutines, but the preemptive timesharing in Modula-2 uses Interrupt handling using IOTRANSFER, but it is best reserved for programs that will run without operating system support. Installing an interrupt handler on a multiuser system is not feasi­ble because doing so would affect other users. (For this reason, IOTRANSFER is not a mandatory feature of Modula-2.) Even on single-user systems, IOTRANSFER can be difficult to use because installing an interrupt handler causes the old interrupt handler (which most likely belongs to the operating system) to be lost. So this is why i think that the best way in modern operating systems is to use non-preemptive timesharing with coroutines, so this is why i am providing you with my sophisticated implementation of stackful coroutines, read about it in my thoughts below:

More of my philosophy about timesharing that is a Solution to Computer Bottlenecks..

I invite you to look at the following very interesting video about timesharing that is a Solution to Computer Bottlenecks:

https://www.youtube.com/watch?v=Q07PhW5sCEk

I think i am smart, and you have to understand one important thing
and it is: What is the difference between a software architect and
a software engineer?, i think there is an important difference and it
is also like abstracted in the following question:

"How it is made?"

So i think that software engineering works at a higher level than
a software architect, this is why you will notice that i am
quickly implementing a sophisticated stackful coroutines
Library and i am quickly implementing setjmp() and longjmp() with
x64 assembler or code machine, read my below thoughts about them, but you have to know that my sophisticated stackful coroutines Library
does a kind of timesharing as in the above video, but i think that there is two kinds of timesharing: the preemptive one, and the non-preemptive one, but the difference is that the preemptive one does interrupt with a timer the coroutines from an external scheduler in
a form of function, but notice below that i am implementing the non-preemptive timesharing in my sophisticated coroutines Library, but you have to be smart and notice that my way of doing is like the software architect way, since i am implementing it from the lowest level with x64 assembler routines that are part of the non-preemptive scheduler, but not only that, but you have also to look at how i am also implementing a
sophisticated and much more rich interface in my stackful coroutines Library, so it is like both software achitecting and software engineering, so here is all my below thoughts that shows how i am implementing it quickly, so read it carefully since you have also to know what's the problem with the stack frames when architecturing and using the setjmp() and longjmp() so that to implement coroutines:

Amine can Daniel Kleitman, Andrew Lawrie, Tom Leighton, George Lusztig, Arthur Mattuck, Davesh Maulik, Richard Melrose, Haynes Miller ever do a geometry proof of Fundamental Theorem of Calculus, or is that totally foreign to them? Mind you, not a limit analysis hornswaggle for that is not geometry.

Amine can L. Reif, William Bertozzi, Robert Birgeneau, Hale Bradt, ever ask the question, which is the atom's real electron, the muon stuck inside a 840MeV proton torus doing the Faraday law or the 0.5MeV particle that AP calls the Dirac magnetic monopole. Or does that thought fly way too above their heads?

MIT math dept.

Michael Artin, Martin Bazant, Bonnie Berger, Roman Bezrukavnikov, Alexei Borodin, John Bush, Herman Chernoff, Henry Cohn, Laurent Demanet, Richard Dudley, Jörn Dunkel, Alan Edelman, Pavel Etingof, Daniel Freedman, Michel Goemans, Vadim Gorin, Harvey Greenspan, Victor Guillemin, Larry Guth, Sigurdur Helgason, Anette Hosoi, David Jerison, Steven Johnson, Victor Kac, Steven Kleiman, Daniel Kleitman, Andrew Lawrie, Tom Leighton, George Lusztig, Arthur Mattuck, Davesh Maulik, Richard Melrose, Haynes Miller, William Minicozzi, Ankur Moitra, Elchanan Mossel, Tomasz Mrowka, James Munkres, Andrei Negut, Aaron Pixton, Bjorn Poonen, Alexander Postnikov, Philippe Rigollet, Rodolfo Rosales, Giulia Saccà, Gerald Sacks, Paul Seidel, Scott Sheffield, Peter Shor, Isadore Singer, Michael Sipser, Jared Speck, Gigliola Staffilani, Richard Stanley, Harold Stark, Gilbert Strang, Daniel Stroock, Goncalo Tabuada, Alar Toomre, David Vogan

President: L. Reif (electrical engineer)

MIT physics dept
William Bertozzi, Robert Birgeneau, Hale Bradt, Bernard Burke, George Clark, Jeffrey Goldstone, Thomas Greytak, Lee Grodzins, Paul Joss, Vera Kistiakowsky, Earle Lomon, Irwin Pless, Paul Schechter, James Young

Princeton University Math dept

Michael Aizenman, Zahra Aminzare, Manjul Bhargava, Nathaniel Bottman, Nicolas Boumal, Jean Bourgain, William Browder,
Tristan Buckmaster, Francesc Castella, Sun-Yung Alice Chang, Otis Chodosh, Maria Chudnovsky, Peter Constantin, Mihalis Dafermos, Gabriele Di Cerbo, Hansheng Diao, Theodore Drivas, Zeev Dvir, Weinan E, Tarek Elgindi, Tolga Etgü, Charles Fefferman,
Jonathan Fickenscher, David Gabai, Ziyang Gao, Javier Gómez-Serrano, Robert C. Gunning, Jonathan Hanselman, Helmut Hofer,
Henry Horton, Yong Hou, Tatiana Howard, Wu-Chung Hsiang, June Huh, Mihaela Ignatova, Alexandru Ionescu, Jennifer M. Johnson, Nicholas Katz, Casey Kelleher, Daniel Ketover, Ilya Khayutin, Seongtag Kim, Sergiu Klainerman, Simon Kochen,
Joseph Kohn, János Kollár, Elliott Lieb, Francesco Lin, Yueh-Ju Lin, Chun-Hung Liu, Robert MacPherson, Adam Marcus,
Fernando Codá Marques, Mark McConnell, Stephen McKeown, Ana Menezes, Sophie Morel, Assaf Naor, Evita Nestoridi,
Huy Quang Nguyen, Oanh Nguyen, Peter Ozsváth, John Pardon, Fabio Pusateri, Igor Rodnianski, Vermont Rutherfoord,
Peter Sarnak, Paul D. Seymour, Tatyana Shcherbyna, Nicholas Sheridan, Goro Shimura, Yakov Shlapentokh-Rothman, Yakov Sinai,
Amit Singer, Christopher Skinner, Allan Sly, Elias Stein, Zoltán Szabó, Yunqing Tang, Richard Taylor, Christine Taylor, Gang Tian,
Konstantin Tikhomirov, Hale Trotter, Karen Uhlenbeck, Vlad Vicol, Ilya Vinogradov, Rafael von Känel, Joseph Waldron, Guangbo Xu,
Paul C. Yang, Ian Zemke, Shou-Wu Zhang, Yongbin Zhang

President: Christopher Eisgruber (physics)

Princeton Univ physics dept

Michael Aizenman, Philip Anderson, Robert Austin, Waseem Bakr, Bogdan Bernevig, Ravindra Bhatt, William Bialek, Frank Calaprice, Curtis Callan, Roberto Car, Paul Chaikin, Kenan Diab, Jo Dunkley, Aurelien Fraisse, Cristiano Galbiati, Simone Giombi, Thomas Gregor, David Gross, Edward Groth, Steven Gubser, Duncan Haldane, William Happer, John Hopfield, Andrew Houck, David Huse, Norman Jarosik, William Jones, Andrew Leifer, Elliot Lieb, Daniel Marlow, Peter Meyers, James Olsen, Lyman Page, James Peebles, Alexander Polyakov, Frans Pretorius, Michael Romalis, Joshua Shaevitz, A. Smith, Shivaji Sondhi, Suzanne Staggs, Paul Steinhardt, David Tank, Joseph Taylor, Christopher Tully, Herman Verlinde, Edward Witten

HISTORY OF THE PROTON MASS and the 945 MeV //Atom Totality series, book 3 Kindle Edition
by Archimedes Plutonium (Author)

In 2016-2017, AP discovered that the real proton has a mass of 840 MeV, not 938. The real electron was actually the muon and the muon stays inside the proton that forms a proton torus of 8 rings and with the muon as bar magnet is a Faraday Law producing magnetic monopoles. So this book is all about why researchers of physics and engineers keep getting the number 938MeV when they should be getting the number 840 MeV + 105 MeV = 945 MeV.

Cover Picture is a proton torus of 8 rings with a muon of 1 ring inside the proton torus, doing the Faraday Law and producing magnetic monopoles.
Length: 17 pages

Product details
• Publication Date : December 18, 2019
• Word Wise : Enabled
• Print Length : 17 pages
• File Size : 698 KB
• ASIN : B082WYGVNG
• Language: : English
• Text-to-Speech : Not enabled
• Enhanced Typesetting : Enabled
• Screen Reader : Supported
• X-Ray : Not Enabled
• Lending : Enabled

#1-4, 105th published book

Atom Geometry is Torus Geometry // Atom Totality series, book 4 Kindle Edition
by Archimedes Plutonium (Author)

Since all atoms are doing the Faraday Law inside them, of their thrusting muon into a proton coil in the shape of a geometry torus, then the torus is the geometry of each and every atom. But then we must explain the neutrons since the muon and proton are doing Faraday's Law, then the neutron needs to be explained in terms of this proton torus with muon inside, all three shaped as rings. The muon is a single ring and each proton is 8 rings. The neutron is shaped like a plate and is solid not hollow. The explanation of a neutron is that of a capacitor storing what the proton-muon rings produce in electricity. Where would the neutron parallel plates be located? I argue in this text that the neutron plates when fully grown from 1 eV until 945MeV are like two parallel plate capacitors where each neutron is part of one plate, like two pieces of bread with the proton-muon torus being a hamburger patty.

Cover Picture: I assembled two atoms in this picture where the proton torus with a band of muons inside traveling around and around the proton torus producing electricity. And the pie-plates represent neutrons as parallel-plate capacitors.
Length: 39 pages

Product details
• Publication Date : March 24, 2020
• Word Wise : Not Enabled
• ASIN : B086BGSNXN
• Print Length : 39 pages
• File Size : 935 KB
• Language: : English
• Text-to-Speech : Not enabled
• Screen Reader : Supported
• X-Ray : Not Enabled
• Enhanced Typesetting : Enabled
• Lending : Enabled
Amazon Best Sellers Rank: #1,656,820 Paid in Kindle Store (See Top 100 Paid in Kindle Store)
#6413 in Mathematics (Kindle Store)
#315 in One-Hour Science & Math Short Reads
#4953 in Physics (Kindle Store)



#1-5, 112th published book

New Perspective on Psi^2 in the Schrodinger Equation in a Atom Totality Universe// Atom Totality series, book 5
Kindle Edition
by Archimedes Plutonium (Author)

I first heard of the Schrodinger equation in college chemistry class. We never actually did any problem solving with the equation, and we were only told about it. Then taking physics my next year in college and after I bought the Feynman Lectures on Physics, just for fun for side reading, three volume set did I learn what this Schrodinger equation and the Psi^2 wavefunction was about. I am not going to teach the mathematics of the Schrodinger equation and the math calculations of the Psi or Psi^2 in this book, but leave that up to the reader or student to do that from Feynman's Lectures on Physics. The purpose of this book is to give a new and different interpretation of what Psi^2 is, what Psi^2 means. Correct interpretation of physics experiments and observations turns out to be one of the most difficult tasks in all of physics.

Cover Picture: a photograph taken of me in 1993, after the discovery of Plutonium Atom Totality, and I was 43 years old then, on a wintery hill of New Hampshire. It is nice that Feynman wrote a physics textbook series, for I am very much benefitting from his wisdom. If he had not done that, getting organized in physics by writing textbooks, I would not be writing this book.. And I would not have discovered the true meaning of the Fine Structure Constant, for it was Feynman who showed us that FSC is really 0.0854, not that of 0.0072. All because 0.0854 is Psi, and Psi^2 is 0.0072.
Length: 20 pages

Product details
• ASIN : B0875SVDC7
• Publication date : April 15, 2020
• Language: : English
• File size : 1134 KB
• Text-to-Speech : Enabled
• Screen Reader : Supported
• Enhanced typesetting : Enabled
• X-Ray : Not Enabled
• Word Wise : Enabled
• Print length : 20 pages
• Lending : Enabled
• Best Sellers Rank: #240,066 in Kindle Store (See Top 100 in Kindle Store)
◦ #5 in 30-Minute Science & Math Short Reads
◦ #65 in General Chemistry & Reference
◦ #481 in Physics (Kindle Store)

#1-6, 135th published book

QED in Atom Totality theory where proton is a 8 ring torus and electron = muon inside proton doing Faraday Law// Atom Totality series, book 6 Kindle Edition
by Archimedes Plutonium (Author) 

Since the real true electron of atoms is the muon and is a one ring bar magnet thrusting through the 8 ring torus of a proton, we need a whole entire new model of the hydrogen atom. Because the Bohr model with the 0.5MeV particle jumping orbitals as the explanation of Spectral Lines is all wrong. In this vacuum of explaining spectral line physics, comes the AP Model which simply states that the hydrogen atom creates Spectral lines because at any one instant of time 4 of the 8 proton rings is "in view" and the electricity coming from those 4 view rings creates spectral line physics.