A key component of manycore systems is the on-chip network, which. Further scaling these designs to tens and hundreds of cores, however, still presents a number of hard problems, such as scalability, power efficiency and effective programming models. Over the past decade, increasing the number of cores on a single processor has successfully enabled continued improvements of computer performance. Furthermore, unlike the unconstrained setting, we show that in the constrained setting wholesale price contracts can be flexible in allocating the channel profit without necessarily sacrificing coordination. We also identify the set of Pareto-dominated contracts in a negotiation setting. In order to convey the worst-case channel performance when these channel-efficient contracts are not used in equilibrium, we quantify the worst-case efficiency loss for the supply channel using a distribution-free method. ![]() Our newsvendor procurement game generalizes the Stackelberg game introduced in Lariviere and Porteus (2001) to allow for multiple suppliers as well as a capacity constraint at the newsvendor. We also explore conditions under which these channel-efficient linear wholesale price contracts result from the equilibrium behavior of a newsvendor procurement game. We analyze how this set of wholesale prices changes as we change the channel's capacity constraint. We prove this for the one-supplier/one-newsvendor supply channel as well as the many-supplier/one-newsvendor channel configuration (with each supplier selling a unique product). have physical or monetary constraints.In the first part of this thesis, we show that when a supply channel is capacity-constrained and the constraint is tight, there is a set of linear wholesale price contracts that coordinates the channel while allowing the supplier to make a profit. Throughout the thesis, we focus on capacity-constrained supply channels, motivated by the fact that most real-world supply chains. This thesis deals with five important ideas pertaining to supply chains and supply contracts: coordination, flexibility in allocating profit, the push-pull boundary, the valuation of capacity, and cooperation versus competition and its effects on profit and prices. By automating the recovery process, the burden of understand the underlying architecture of the intelligent space is removed from the user. In the second stage, a alternate plan is selected to recover from the failure. In the first stage, the failure is diagnosed using Bayesian networks. SPRIE is an automated system that uses a two-stage process for recovery from plan execution failures. ![]() In Charles River City, students work in teams to SPRIE. To deal with these failures, we have developed a system for plan recovery in intelligent spaces called a desktop multi-player virtual simulation game. ![]() Unfortunately, these plans are not always executed flawlessly. In an effort to make these types of spaces more useable for people who neither care about nor want to understand the underlying technology, encapsulation of high-level ideas into plans is being explored. As intelligent spaces have become more prevalent, the need for diagnosis and recovery from failures in these spaces has also grown.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |