Is this possible?

[Joel Rees]

On Thu, Oct 6, 2016 at 6:58 PM, Bob <ubuntu-qygzanxc at listemail.net> wrote:
> ** Reply to message from Joel Rees <joel.rees at gmail.com> on Thu, 6 Oct 2016
> 18:25:14 +0900
>[...]
>> > > You should be aiming for all your work to fit in memory. Swap is only
>> > > efficient when it is used to swap out bits of memory that are not
>> > > being used by running processes (say initialization code, or code that
>> > > isn't used often.)
>> >
>> > This is why paging works and what it was designed to do.  Of course over
>> > committing memory heavily is not a good idea.
>>
>> How does paging work if there's no swap and a process is demanding
>> more memory allocation?
>
> It returns an error code to the program and lets the program decide what to do.

And most application software  punts at this point.

> It can then terminate, wait and retry or something else?

Even the stuff that waits seems mostly to have never heard about deadlock.

> Of course this
> program may not be the program causing the problem but that is another
> discussion.
> [...]

In PC land, all applications are still at each others' mercy in many
significant ways.

True process memory space separation has not yet been fully
implemented. That is one of the areas in which common sense was
sacrificed by the CPU vendors for the almighty performance curve.
There have been some significant improvements recently, but we still
aren't very close yet.

And partitioning CPUs, well, ...

Mainframe Linux OSses are better about this kind of thing, but you
should wonder why "hypervisor" software is a separate product.

-- 
Joel Rees

I'm imagining I'm a novelist:
http://joel-rees-economics.blogspot.com/2016/04/economics-101-novel-rough-draft-index.html