Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the power of the linear array architecture for performing tree- structured computations

From MaRDI portal
Publication:1892200
Jump to:navigation, search

DOI10.1006/JCSS.1995.1001zbMath0827.68009OpenAlexW1997409844MaRDI QIDQ1892200

Yaacov Yesha, Konstantinos Kalpakis

Publication date: 13 December 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1995.1001


zbMATH Keywords

schedulinglinear array architecture


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)


Related Items (1)

Scheduling tree dags on parallel architectures







This page was built for publication: On the power of the linear array architecture for performing tree- structured computations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1892200&oldid=14296161"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki