Multi-Socket vs Multi-core

For the resent advancement in technology, we have made an advancement in computer hardware
technology that gives us the opportunity to use more than one CPUs, with it being an even
number, per motherboard. For the majority of times, this advance easified the workload for some
servers. But the problem lies within that, at some point, with an overflow of workload, the Multi
socketed systems hit on their maximum performance. And start to lose their performance
exponentially; much like an upside-down parabola function. Not only that, but also that the
validance of these Multi-CPUs in the systems watermarks the requirements to operate too. While
performing tests on some Multi socket systems, the results have shown that just by adding one
more CPU to the system, the total power requirement for the system tripled. Additionally, there
are many “fatal” errors occurring; as the CPUs have no great bond on each other, them cannot act
as the host allocator. For example: CPU-1 wants to store something on RAM on a specific location,
but CPU-2 also wants to-this makes a fatal error on the system as RAM cannot let the two happen
simultaneously; To fix this, we could connect these two CPUs with lines to communicate, but this
would drastically reduce the performance of the CPUs as their valuable lines would be unusable.
The problem solver of them all is to just keep a few lines between connected, but also let each of
the CPUs have their own primary hardware. This means that each CPU would have its own storage
partition, RAM, etc. But still, them having their own hardware makes a problem too. So the system
to work as an ordinary, with the 2 CPUs working together, there would be a need of a “host” CPU;
the problem of before arises too. More the workload means that the host would need to take the
actions of a “slave” CPU on itself too. This representation below may show it:
To what extent are virtual machines safe?
By a recent software advancement, we have made what is called a virtual machine. Inside a normal
application, we are able to boot another Operating System. This is done by launching an OS inside
of an application, and allocating a piece of RAM and CPU to its use. Basically, we dedicate 4GB of
System Operative Memory to the use of solely the virtual machine. Even more recently, Microsoft,
the creator of Windows OS, made an upper step to virtual machinery. Microsoft made a specific
program which makes a Second Windows OS open in your primary one. What the step-up is, that
when a virtual machine is running, it needs minimal amount of space to run the OS; the critical files
such as Kernel and the Software itself, basically what it needs to just work. Microsoft made this
disadvantage gone by managing to share main systems critical filet needed to operate with the
virtual machine, reducing solely allocated space.
This creation of Virtual Machinery is truly a miracle. An application of it is mainly for testing
programs in development, or safely doing things with dangers for Machinery; Examples may be to
access a dangerous website without worries, opening files to ensure safety, or testing
cybersecurity. Experts of Cybersecurity say that this invention is magnificent and totally reliable,
however, this was all a lie. There are some cases in which we cannot maneuver through these
dangers. For example: nowadays viruses are evolved to a state which they can understand that
they are in a virtual machine, and execute a certain piece of ode to infect the host, or infect the
network and spread to not only the host machine, but other devices on the net too.
This is the problem with current Virtual Machinery. To conclude, the only thing we can say is that
right now we cannot fully rely on this piece of technology.
How does Quantum computing break encryption, and how to solve it.(Dangers of quantum
computing?)
Quantum computing is a new miracle invention of the 21st century. Merely after 50 years after the
first invention of computers size of half of a general classroom, we made it to a size of a matchbox.
This invention makes computer processing skyrocket to 1000 times worth, and a size of 10 times
smaller than a general today’s laptop. What is so special about them is that is by reducing the
transmitter’s sizes to near-molecular level, we can achieve an encoding of 4 elements. Away from
binary, which has 1s and 0s, quantum computers use 1s, 0s, both and neither. How? The answer is
that we use general principles in binary encoding and adding several elements for use of “both and
neither” such as a power level of a photon, or number of spins in an electron. But how does this
really help us? By giving 2 more elements to computation aside from 1 and 0, capabilities of
calculations increase. There are even cases in which, what a quantum computer does in seconds,
may take years for an ordinary supercomputer. But its use in not yet very efficient for a consumer
use. For example, its overheating. For a stable operation of a quantum computer an absolute zero
is required. Giant boxes as of refrigerators have enormous cooling systems which super freeze the
environment. The quantum computers look of a chandelier is for purpose of better cooling too. But
the biggest problem of tem all is that quantum computing breaks encryption. As said earlier,
quantum computers have better capabilities at calculation. A mere decryption of a 5-star
encrypted date feels like nothing to a quantum computer. In ordinary use, this could create giant
problems for users and companies who value their data the most. To fix this break, we can use
encryption based on the “Knapsack” problem. This method gives us a chance to overwhelm
quantum computers by giving them more ways for encryption keys. 2 factor would be 1.5 times
weaker than 3 factor, 3 factor is 3 times weaker that 4 factor, 4 factor is 10 times weaker than 5
factor and so on. With an exponential increase we may set our key to it with a 1000 factor, which
would take an eternity to solve. The way to say is that we need to overload the capabilities of even
quantum computers.