Parallel and distributed computing systems are foundational to the success of cloud computing and... more Parallel and distributed computing systems are foundational to the success of cloud computing and big data analytics. Fork-Join Queueing Networks with Blocking (FJQN/Bs) are natural models for such systems. While engineering solutions have long been made to build and scale such systems, it is challenging to rigorously characterize the throughput performance of ever-growing systems, especially in the presence of heavy-tailed delays. In this paper, we utilize an infinite sequence of FJQN/Bs to study the throughput limit and focus on regularly varying service times with index α>1. We introduce two novel geometric concepts - scaling dimension and extended metric dimension - and show that an infinite sequence of FJQN/Bs is throughput scalable if the extended metric dimension <α-1 and only if the scaling dimension łe α-1. These results provide new insights on the scalability of a rich class of FJQN/Bs.
Parallel and distributed processing systems have expanded in size as technology advances in cloud... more Parallel and distributed processing systems have expanded in size as technology advances in cloud computing and big data analytics. A critical issue concerns throughput scalability: whether throughput decreases to zero as the systems scale in size and capabilities. We model parallel and distributed processing systems as fork and join queueing networks with blocking (FJQN/Bs). Such networks can have arbitrary topology, arbitrary initial state, and generally distributed service times. We propose a key topological concept, called the “minimum level,” that determines the throughput scalability of FJQN/Bs. We construct throughput bounds as functions of minimum level, network degree, buffer sizes, and processing speed, and we present necessary and/or sufficient conditions to guarantee throughput scalability of arbitrary size and topology FJQN/Bs. The e-companion is available at https://doi.org/10.1287/opre.2018.1748 .
Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016
Due to emerging applications such as cloud computing and big data analytics, modern information p... more Due to emerging applications such as cloud computing and big data analytics, modern information processing systems are growing increasingly large and complex. A critical issue concerns the throughput performance as the system grows in size. This paper models distributed information processing systems as fork and join queueing networks with blocking. We identify necessary and sufficient conditions for throughput scalability of such fork and join networks as they grow in size. Previous studies have either focused on special structured networks such as tandem or tree networks, or provided only necessary conditions for throughput scalability. In this paper, we show that such necessary conditions are not sufficient. We present a key topological concept called "minimum level" of the underlying graph, and develop lower and upper bounds for the throughput of arbitrary FJQN/Bs. The bounds depend on network degree, minimum level, deterministic cycle time, buffer sizes, and service time distributions, but not on network size. We show that levelboundedness and degree-boundedness are necessary and sufficient conditions to guarantee that the throughput of an FJQN/B is bounded away from zero as network size goes to infinity.
Information Management & Computer Security, 2003
In today’s dynamic and changing environment, companies have a strong need to create or sustain th... more In today’s dynamic and changing environment, companies have a strong need to create or sustain their competitive advantages. In order to be competitive, companies need to be responsive and closer to the customers, and deliver value‐added products and services as quickly as possible. Companies also need to be able to support organizational information needs faster and better than their competitors. These goals can be realized by applying two emerging information technologies: enterprise resource planning (ERP) supporting business process integration; and data warehousing supporting data integration. Companies with the further integration of ERP and data warehousing will have great advantages in the competitive environment. Two cases have been studied and presented to illustrate its values.
Information Management & Computer Security, 2003
Customer relationship management (CRM) and business‐to‐business (B2B) are essential to the succes... more Customer relationship management (CRM) and business‐to‐business (B2B) are essential to the success of modern business. Although they are two different modules, they share many similarities. The integration of CRM and B2B will benefit all related parties in business processes, including sales, marketing, customer service, and information support. This article discusses the characteristics, similarities, and differences of B2B and CRM. It also explores the CRM‐B2B integration strategies, the current issues and their future development trends.
Parallel and distributed computing systems are foundational to the success of cloud computing and... more Parallel and distributed computing systems are foundational to the success of cloud computing and big data analytics. Fork-Join Queueing Networks with Blocking (FJQN/Bs) are natural models for such systems. While engineering solutions have long been made to build and scale such systems, it is challenging to rigorously characterize the throughput performance of ever-growing systems, especially in the presence of heavy-tailed delays. In this paper, we utilize an infinite sequence of FJQN/Bs to study the throughput limit and focus on regularly varying service times with index α>1. We introduce two novel geometric concepts - scaling dimension and extended metric dimension - and show that an infinite sequence of FJQN/Bs is throughput scalable if the extended metric dimension <α-1 and only if the scaling dimension łe α-1. These results provide new insights on the scalability of a rich class of FJQN/Bs.
Parallel and distributed processing systems have expanded in size as technology advances in cloud... more Parallel and distributed processing systems have expanded in size as technology advances in cloud computing and big data analytics. A critical issue concerns throughput scalability: whether throughput decreases to zero as the systems scale in size and capabilities. We model parallel and distributed processing systems as fork and join queueing networks with blocking (FJQN/Bs). Such networks can have arbitrary topology, arbitrary initial state, and generally distributed service times. We propose a key topological concept, called the “minimum level,” that determines the throughput scalability of FJQN/Bs. We construct throughput bounds as functions of minimum level, network degree, buffer sizes, and processing speed, and we present necessary and/or sufficient conditions to guarantee throughput scalability of arbitrary size and topology FJQN/Bs. The e-companion is available at https://doi.org/10.1287/opre.2018.1748 .
Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016
Due to emerging applications such as cloud computing and big data analytics, modern information p... more Due to emerging applications such as cloud computing and big data analytics, modern information processing systems are growing increasingly large and complex. A critical issue concerns the throughput performance as the system grows in size. This paper models distributed information processing systems as fork and join queueing networks with blocking. We identify necessary and sufficient conditions for throughput scalability of such fork and join networks as they grow in size. Previous studies have either focused on special structured networks such as tandem or tree networks, or provided only necessary conditions for throughput scalability. In this paper, we show that such necessary conditions are not sufficient. We present a key topological concept called "minimum level" of the underlying graph, and develop lower and upper bounds for the throughput of arbitrary FJQN/Bs. The bounds depend on network degree, minimum level, deterministic cycle time, buffer sizes, and service time distributions, but not on network size. We show that levelboundedness and degree-boundedness are necessary and sufficient conditions to guarantee that the throughput of an FJQN/B is bounded away from zero as network size goes to infinity.
Information Management & Computer Security, 2003
In today’s dynamic and changing environment, companies have a strong need to create or sustain th... more In today’s dynamic and changing environment, companies have a strong need to create or sustain their competitive advantages. In order to be competitive, companies need to be responsive and closer to the customers, and deliver value‐added products and services as quickly as possible. Companies also need to be able to support organizational information needs faster and better than their competitors. These goals can be realized by applying two emerging information technologies: enterprise resource planning (ERP) supporting business process integration; and data warehousing supporting data integration. Companies with the further integration of ERP and data warehousing will have great advantages in the competitive environment. Two cases have been studied and presented to illustrate its values.
Information Management & Computer Security, 2003
Customer relationship management (CRM) and business‐to‐business (B2B) are essential to the succes... more Customer relationship management (CRM) and business‐to‐business (B2B) are essential to the success of modern business. Although they are two different modules, they share many similarities. The integration of CRM and B2B will benefit all related parties in business processes, including sales, marketing, customer service, and information support. This article discusses the characteristics, similarities, and differences of B2B and CRM. It also explores the CRM‐B2B integration strategies, the current issues and their future development trends.
Uploads
Papers by Yun ZENG