✦ LIBER ✦

Some problems of planning the computing process in a network of computing centers

✍ Scribed by R. B. Kukhar; É. V. Lyantse

Publisher: Springer US
Year: 1980
Tongue: English
Weight: 452 KB
Volume: 15
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01075103

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some problems in the theory of network p

Some problems in the theory of network planning

✍ Yu. P. Krivenkov 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 596 KB

Computing the performance index of a com

Computing the performance index of a computer network

✍ Suresh Rai; Arun Kumar; E.V. Prasad 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 312 KB

On planning the solution process for a p

On planning the solution process for a problem on a computer complex

✍ M. F. Kaspshitskaya; I. V. Sergienko 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 395 KB

Problems with a node of computer network

Problems with a node of computer networks

✍ Vukašin P. Masnikosa 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 684 KB

The role of process planning in computer

The role of process planning in computer integrated manufacturing

✍ J.W. Lyons 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 127 KB

One of the central problems in assessing the role of process planning in CIM is the paucity of current systems available to address the stringent needs of CAPP in a CIM context. This paper reviews these stringent needs and classifies the available systems accordingly. It concludes with a summary of

Global computing in a dynamic network of

Global computing in a dynamic network of tuple spaces

✍ Rocco De Nicola; Daniele Gorla; Rosario Pugliese 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 405 KB

We present TKLAIM (Topological KLAIM), a process description language that retains the main features of KLAIM (process distribution and mobility, remote and asynchronous communication through distributed data spaces), but extends it with new constructs to flexibly model the interconnection structure