A hybrid solution of fork/join synchronization in parallel queues

Chen, Ray Jinzhu

doi:10.1109/71.946659

Cited by 30 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Makowski (1989), Varma andMakowski (1994) Maximum order statistics are used to approximate the synchronization time of heterogeneous full fork systems in Lebrecht and Knottenbelt (2007); Harrison and Zertal (2003). Chen (2001) applies a bubble sort analysis in combination with simulation to approximate an upper bound for the mean response time of an open full-fork homogeneous queueing system. A matrix geometric solution is applied to derive the upper and lower bounds of the performance measures of a heterogeneous full-fork open system in Balsamo et al (1998) and to calculate the moments of the mean queue lengths in Balsamo and Mura (1997).…”

Section: Related Workmentioning

confidence: 99%

Approximating closed fork-join queueing networks using product-form stochastic Petri-nets

Osman

Harrison

2015

Journal of Systems and Software

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Approximating closed fork-join queueing networks using product-form stochastic Petri-nets

Osman

Harrison

2015

Journal of Systems and Software

View full text Add to dashboard Cite

“…Starting from the initial definition, many programming languages used the Fork/Join concept in several ways. The Fork/Join operations has been largely studied from a queueing point of view [17][18][19]. The Fork/Join linguistic framework is available in Java [20].…”

mentioning

confidence: 99%

XML-VM: An XML-Based Grid Computing Middleware

Cuzzocrea

Mumolo

Tessarotto

et al. 2017

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

This paper describes a novel distributing computing middleware named XML-VM. Its architecture is inspired by the 'Grid Computing' paradigm. The proposed system improves many characteristics of previous Grid systems, in particular the description of the distributed computation, the distribution of the code and the execution times. XML is a markup language commonly used to interchange arbitrary data over the Internet. The idea behind this work is to use XML to describe algorithms; XML documents are distributed by means of XML-RPC, interpreted and executed using virtual machines. XML-VM is an assembly-like language, coded in XML. Parsing of XML-VM programs is performed with a fast SAX parser for JAVA. XML-VM interpreter is coded in JAVA. Several algorithms are written in XML-VM and executed in a distributed environment. Representative experimental results are reported.

show abstract