Author image not provided
 Yogen Kantilal Dalal

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article15.00
Citation Count240
Publication count16
Publication years1975-2001
Available for download6
Average downloads per article1,414.67
Downloads (cumulative)8,488
Downloads (12 Months)390
Downloads (6 Weeks)20
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


16 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 16 of 16
Sort by:

1
November 2001 Classic operating systems: from batch processing to distributed systems
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0


2
December 1988 Innovations in Internetworking
Publisher: Artech House, Inc.
Bibliometrics:
Citation Count: 0


3
March 1987 IEEE Transactions on Software Engineering: Volume 13 Issue 3, March 1987
Publisher: IEEE Press
Bibliometrics:
Citation Count: 3

Most algorithms for constructing minimal spanning trees are sequential in operation. Distributed algorithms for constructing these trees operate both concurrently and asynchronously, and are useful in store-and-forward packet-switching computer-communication networks where there is typically no single source of control. The difficulties in designing such algorithms arise from communication and synchronization ...
Keywords: synchronization, minimal spanning tree, protocols, synchronization, Broadcast routing, computer-communication networks, distributed algorithms, minimal spanning tree, protocols, store-and-forward packet-switching, Broadcast routing, computer-communication networks, distributed algorithms, store-and-forward packet-switching

4
March 1987 IEEE Transactions on Software Engineering: Volume 13 Issue 3, March 1987
Publisher: IEEE Press
Bibliometrics:
Citation Count: 2


5
July 1983 Proceedings on Local Area Networks: An Advanced Course
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1


6 published by ACM
July 1983 ACM Transactions on Information Systems (TOIS): Volume 1 Issue 3, July 1983
Publisher: ACM
Bibliometrics:
Citation Count: 37
Downloads (6 Weeks): 2,   Downloads (12 Months): 21,   Downloads (Overall): 786

Full text available: PDFPDF

7
October 1982 Computer: Volume 15 Issue 10, October 1982
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 2

First Page of the Article

8
August 1982 Computer: Volume 15 Issue 8, August 1982
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 4

First Page of the Article

9
May 1982 Proceedings of the IFIP WG6.1 Second International Workshop on Protocol Specification, Testing and Verification
Publisher: North-Holland Publishing Co.
Bibliometrics:
Citation Count: 0


10 published by ACM
October 1981 ACM SIGCOMM Computer Communication Review: Volume 11 Issue 4, October 1981
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 0,   Downloads (12 Months): 12,   Downloads (Overall): 367

Full text available: PDFPDF
Xerox internets and Ethernet local computer networks use 48-bit absolute host numbers. This is a radical departure from practices currently in use in internetwork systems and local networks. This paper describes how the host numbering scheme was designed in the context of an overall internetwork and distributed systems architecture.
Also published in:
October 1981  SIGCOMM '81: Proceedings of the seventh symposium on Data communications

11 published by ACM
February 1980 Communications of the ACM: Volume 23 Issue 2, Feb. 1980
Publisher: ACM
Bibliometrics:
Citation Count: 70
Downloads (6 Weeks): 14,   Downloads (12 Months): 292,   Downloads (Overall): 4,349

Full text available: PDFPDF
Keywords: modular programming, personal computer, high-level language, operating system, system structure, network, file, process, virtual memory

12 published by ACM
December 1979 SOSP '79: Proceedings of the seventh ACM symposium on Operating systems principles
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 3,   Downloads (12 Months): 25,   Downloads (Overall): 302

Full text available: PDFPDF
The Pilot operating system is designed for the personal computing environment. It provides a basic set of services within which higher-level programs can more easily serve the user and/or communicate with other programs on other machines. Pilot omits certain functions sometimes associated with “complete” operating systems, such as character-string naming ...

13 published by ACM
December 1978 Communications of the ACM: Volume 21 Issue 12, Dec. 1978
Publisher: ACM
Bibliometrics:
Citation Count: 97
Downloads (6 Weeks): 1,   Downloads (12 Months): 35,   Downloads (Overall): 2,423

Full text available: PDFPDF
A broadcast packet is for delivery to all nodes of a network. Algorithms for accomplishing this delivery through a store-and-forward packet switching computer network include (1) transmission of separately addressed packets, (2) multidestination addressing, (3) hot potato forwarding, (4) spanning tree forwarding, and (5) source based forwarding. To this list ...
Keywords: store-and-forward packet switching, broadcast protocols, computer networks, routing, broadcast packets, reverse path forwarding

14

15
June 1976
Bibliometrics:
Citation Count: 0

This paper presents a distributed algorithm for constructing minimal spanning trees in computer-communication networks. The algorithm can be executed concurrently and asynchronously by the different computers of the network. This algorithm is also suitable for constructing minimal spanning trees using a multiprocessor computer system. There are many reasons for constructing ...

16 published by ACM
January 1975 ACM SIGOPS Operating Systems Review: Volume 9 Issue 3, July 1975
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 261

Full text available: PDFPDF
This note serves to supplement and extend the ideas and issues raised in [TO74]. Tomlinson examines the problem of establishing a connection (association), and being able to detect delayed packets of an old incarnation of a connection, when it is being opened and closed in quick succesion, or when the ...
Also published in:
January 1975  Proceedings of the 1975 ACM SIGCOMM/SIGOPS workshop on Interprocess communications



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us