Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept

Time-sharing

In computing, time-sharing is the sharing of a computing resource among many users at the same time by means of multiprogramming and multi-tasking. Its emergence as the prominent model of computing in the 1970s represented a major technological shift in the history of computing. By allowing many users to interact concurrently with a single computer, time-sharing dramatically lowered the cost of providing computing capability, made it possible for individuals and organizations to use a computer without owning one, and promoted the interactive use of computers and the development of new interactive applications. History Batch processing Batch processing The earliest computers were extremely expensive devices, and very slow in comparison to later models. Machines were typically dedicated to a particular set of tasks and operated by control panels, the operator manually entering small programs via switches in order to load and run a series of programs. These programs

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Related people

Related units

Related concepts

Related courses

Related lectures

Summary

Official source

About this result

Related publications (19)

Related publications

Related people (2)

Related people

Related units (1)

Related units

Related concepts (54)

Related concepts

Related courses (9)

This course addresses the relationship between specific technological features and the learners' cognitive processes. It also covers the methods and results of empirical studies on this topic: do student actually learn due to technologies?

This course will cover mathematical concepts and efficient numerical methods for geometric computing. We will develop and implement algorithms to simulate and optimize 2D and 3D geometric models with an emphasis towards computational design for digital fabrication.

Introduction to basic concepts of operating systems.

Related courses

Related lectures (17)

Related lectures

Coding schemes for broadcast erasure channels with feedback: the two multicast case

Christina Fragouli, Efe Onaran

We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of

N

users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent work on BPEC with unicast and degraded messages [1], [2], we propose a virtual queue based session-mixing algorithm, which does not rely on knowledge of channel statistics and achieves capacity for

N=2

and iid erasures. Since the optimal extension of this algorithm to

N>2

is not straightforward, we then describe a low complexity algorithm which outperforms standard timesharing for arbitrary

N

and is actually asymptotically better than timesharing, for any finite

N

, as the erasure probability goes to zero. We finally provide, through an information-theoretic analysis, sufficient but not necessary asymptotic conditions between

N

and

n

(the number of transmissions) for which the achieved sum rate, under \textit{any} coding scheme, is essentially identical to that of timesharing.

2013

We consider the symmetric Gaussian interference channel where two users try to enhance their secrecy rates in a cooperative manner. Artificial noise is introduced along with useful information. We derive the power control and artificial noise parameter for two kinds of optimal points, max-min point and single user point. It is shown that there exists a critical value P-c of the power constraint, below which the max-min point is an optimal point on the secrecy rate region, and above which time-sharing between single user points achieves larger secrecy rate pairs. It is also shown that artificial noise can help to enlarge the secrecy rate region, in particular on the single user point. © 2006 IEEE.

2010

Compute-forward multiple access (CFMA) with nested LDPC codes

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Erixhen Sula, Jingge Zhu

Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages. This strategy, coined compute-forward multiple access (CFMA), provably achieves points on the dominant face of the multiple-access capacity region while circumventing the need of time sharing or rate splitting. For a two-user multiple-access channel (MAC), we propose a practical procedure to design suitable codes from off-the-shelf LDPC codes and present a sequential belief propagation decoder with complexity comparable with that of point-to-point decoders. We demonstrate the potential of our strategy by comparing several numerical evaluations with theoretical limits.

2017

Operating system

An operating system (OS) is system software that manages computer hardware and software resources, and provides common services for computer programs. Time-sharing operating systems schedule tasks f

BASIC

BASIC (Beginners' All-purpose Symbolic Instruction Code) is a family of general-purpose, high-level programming languages designed for ease of use. The original version was created by John G. Kemeny a

Personal computer

A personal computer (PC) is a multi-purpose microcomputer whose size, capabilities, and price make it feasible for individual use. Personal computers are intended to be operated directly by an end u

Introduction to basic concepts of operating systems.