Article

Free access

Decentralized optimal power pricing: the development of a parallel program

Authors:

S. Lumetta,

L. Murphy,

X. Li,

D. Culler,

I. KhalilAuthors Info & Claims

Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing

Pages 240 - 249

https://doi.org/10.1145/169627.169718

Published: 01 December 1993 Publication History

PDF eReader

References

[1]

D. F. Bacon and S. E. Lucco, "Tarmac: A Mobile Memory System for the Connection Machine CM- 5," Draft

Google Scholar

[2]

D. E. Culler, A. Dusseau, S. C. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, K. Yelick, "Introduction to Split-C," to be published in Proceedings of Supercomputing, 1993.

Google Scholar

[3]

D. Gelernter, "Parallel Programming in Linda," Proceedings of the International Conference on Parallel Processing, pp. 255-263, Aug. 1985.

Google Scholar

[4]

K. Li and P. Hudak, "Memory Coherence in Shared Virtual Memory Systems," Proceedings of the 5th AT~nual A CM Syrup. on A CM Conf. on Principles on Distributed Computing, pp. 229-239, 1986.

Digital Library

Google Scholar

[5]

S. E. Lucco and D. P. Anderson, "Tarmac: a Language System Substrate Based on Mobile Memory," UCB Report CSD 89/#525, November 1989.

Digital Library

Google Scholar

[6]

D. G. Luenberger, Linear and Nonlinear Programming, 2nd. Ed., Addison-Wesley, 1989.

Google Scholar

[7]

L. Murphy, R. J. Kaye and F. F. Wu, "Distributed Spot Pricing in Radial Distribution Systems," Paper 93 WM 148-7 PWRS, presented at the IEEE Power Engineering Society 1993 Winter Meeting, Columbus, Oit, Jan 31- Feb 5, 1993.

Google Scholar

[8]

P. StenstrSm, "A Survey of Cache Coherence Scheme for Multiprocessors," IEEE Computer, pp. 12-24, June 1990.

Digital Library

Google Scholar

[9]

T. von Eicken, D. E. Culler, S. C. Goldstein, K. E. Schauser, "Active Messages: a Mechanism for Integrated Communication and Computation," UCB Report CSD 92/#675, March 1992.

Digital Library

Google Scholar

Cited By

View all

Hwang_cor YSaltz J(2003)Interprocedural definition-use chains of dynamic pointer-linked data structuresScientific Programming10.1155/2003/15416911:1(3-37)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.1155/2003/154169
Zee KRinard M(2002)Write barrier removal by static analysisACM SIGPLAN Notices10.1145/583854.58243937:11(191-210)Online publication date: 4-Nov-2002
https://dl.acm.org/doi/10.1145/583854.582439
Zee KRinard MIbrahim MMatsuoka S(2002)Write barrier removal by static analysisProceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications10.1145/582419.582439(191-210)Online publication date: 4-Nov-2002
https://dl.acm.org/doi/10.1145/582419.582439
Show More Cited By

Index Terms

Recommendations

Optimal Continuous Pricing with Strategic Consumers

An important economic problem is that of finding optimal pricing mechanisms to sell a single item when there are a random number of buyers who arrive over time. In this paper, we combine ideas from auction theory and recent work on pricing with ...
Optimal pricing for submodular valuations with bounded curvature
AAAI'17: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence

The optimal pricing problem is a fundamental problem that arises in combinatorial auctions. Suppose that there is one seller who has indivisible items and multiple buyers who want to purchase a combination of the items. The seller wants to sell his items ...
Optimal online pricing with network externalities

We study the optimal pricing strategy for profit maximization in presence of network externalities where a decision to buy a product depends on the price offered to the buyer and also on the set of her friends who have already bought that product. We ...

Comments

Information & Contributors

Information

Published In

Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing

December 1993

935 pages

ISBN:0818643404

DOI:10.1145/169627

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '93

Sponsor:

SIGARCH
IEEE-CS

SC '93: International Conference for High Performance Computing, Networking, Storage and Analysis

November 15 - 19, 1993

Oregon, Portland, USA

Acceptance Rates

Supercomputing '93 Paper Acceptance Rate 72 of 300 submissions, 24%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
210
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)6

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hwang_cor YSaltz J(2003)Interprocedural definition-use chains of dynamic pointer-linked data structuresScientific Programming10.1155/2003/15416911:1(3-37)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.1155/2003/154169
Zee KRinard M(2002)Write barrier removal by static analysisACM SIGPLAN Notices10.1145/583854.58243937:11(191-210)Online publication date: 4-Nov-2002
https://dl.acm.org/doi/10.1145/583854.582439
Zee KRinard MIbrahim MMatsuoka S(2002)Write barrier removal by static analysisProceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications10.1145/582419.582439(191-210)Online publication date: 4-Nov-2002
https://dl.acm.org/doi/10.1145/582419.582439
Zee KRinard M(2002)Write barrier removal by static analysisACM SIGPLAN Notices10.1145/510857.51086637:4(32-41)Online publication date: 1-Apr-2002
https://dl.acm.org/doi/10.1145/510857.510866
Carlisle MRogers A(2001)Supporting dynamic data structures with OldenCompiler optimizations for scalable parallel systems10.5555/380466.380486(709-749)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.5555/380466.380486
Carlisle MRogers A(2001)Supporting Dynamic Data Structures with OldenCompiler Optimizations for Scalable Parallel Systems10.1007/3-540-45403-9_20(709-749)Online publication date: 18-May-2001
https://doi.org/10.1007/3-540-45403-9_20
Raghavachari MRogers A(1999)AceACM Transactions on Computer Systems10.1145/320656.32065717:3(202-248)Online publication date: 1-Aug-1999
https://dl.acm.org/doi/10.1145/320656.320657
Hendren LTang XZhu YGhobrial SGao GXue XCai HOuellet P(1997)Compiling C for the EARTH multithreaded architectureInternational Journal of Parallel Programming10.1007/BF0269990525:4(305-338)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1007/BF02699905
Ghiya RHendren LBoehm HSteele G(1996)Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in CProceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/237721.237724(1-15)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/237721.237724
Hendren LXinan Tang Yingchun Zhu Gao GXun Xue Haiying Cai Ouellet P(1996)Compiling C for the EARTH multithreaded architectureProceedings of the 1996 Conference on Parallel Architectures and Compilation Technique10.1109/PACT.1996.552551(12-23)Online publication date: 1996
https://doi.org/10.1109/PACT.1996.552551
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Optimal Continuous Pricing with Strategic Consumers

Optimal pricing for submodular valuations with bounded curvature

Optimal online pricing with network externalities

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Optimal Continuous Pricing with Strategic Consumers

Optimal pricing for submodular valuations with bounded curvature

Optimal online pricing with network externalities

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations