Author: claimsbot

1. A data processing apparatus comprising:
a processor configured to perform data processing operations by executing instructions, said data processing operations comprising accessing data values stored in a memory;
a cache configured to store local copies of a subset of said data values, wherein said cache is configured to maintain a status value for each local copy stored in said cache; and
an exclusive use monitor configured to monitor a selected memory location for accesses,
wherein said processor is configured to execute a load-exclusive operation, said load-exclusive operation comprising loading a first data value from a specified memory location and causing said exclusive use monitor to begin monitoring said specified memory location,
wherein said processor is configured to execute a store-exclusive operation, said store-exclusive operation comprising storing a second data value to said specified memory location if said exclusive use monitor indicates that said first data value at said specified memory location has not been modified since said load-exclusive operation was executed,
and wherein, when a local copy of said first data value is stored in said cache and said status value for said local copy of said first data value indicates that said processor has exclusive usage of said first data value, said data processing apparatus is configured to prevent modification of said status value for a predetermined time period after said processor has executed said load-exclusive operation,
a pending instruction queue populated by pending instructions which have been decoded but not yet executed, wherein said data processing apparatus is configured to prevent modification of said status value with reference to said pending instructions,
wherein said data processing apparatus is configured to identify a first set of pending instructions in said pending instruction queue when an instruction configured to cause execution of at least part of said load-exclusive operation is in said pending instruction queue,
wherein execution of said first set of pending instructions must be completed before execution of said store-exclusive operation completes, and said data processing apparatus is configured to prioritize execution of said first set of pending instructions.
2. The data processing apparatus as claimed in claim 1, wherein said memory is shared with at least one other processor and said cache is configured to maintain said status value for each local copy stored in said cache in dependence on a coherency protocol administered for said processor and said at least one other processor.
3. The data processing apparatus as claimed in claim 1, wherein execution of said first set of pending instructions must be completed before execution of said store-exclusive operation completes to avoid a hazard condition risk with respect to said specified memory location.
4. The data processing apparatus as claimed in claim 1, wherein said data processing apparatus is configured to allow instructions in said first set of pending instructions to complete before said load-exclusive operation completes, even if said instructions in said first set of pending instructions have been scheduled to complete after said load-exclusive operation.
5. The data processing apparatus as claimed in claim 1, wherein said data processing apparatus is configured to prevent modification of said status value by locking access to at least part of said cache.
6. The data processing apparatus as claimed in claim 5, wherein said data processing apparatus is configured to prevent modification of said status value by locking access to a cache line in which said local copy of said first data value is stored said cache.
7. The data processing apparatus as claimed in claim 5, wherein said cache is configured to store each said local copy of a data value in a location in said cache determined by an index portion of a memory address of said data value, and wherein said data processing apparatus is configured to prevent modification of said status value by locking access to regions of said cache identified by said index portion.
8. The data processing apparatus as claimed in claim 1, further comprising a timer configured to run for said predetermined time period, wherein said data processing apparatus is configured to start said timer when said processor executes said load-exclusive operation.
9. The data processing apparatus as claimed in claim 1, wherein said data processing apparatus is configured to count elapsed clock cycles after said processor executes said load-exclusive operation, and said predetermined time period is determined as a predetermined number of elapsed clock cycles.
10. The data processing apparatus as claimed in claim 1, wherein said data processing apparatus is configured to determine, for each of multiple instances of execution of said load-exclusive operation followed by said store-exclusive instruction, a relative timing of execution of said store-exclusive operation by said processor and an end of said predetermined time period after said processor has executed said load-exclusive operation.
11. The data processing apparatus as claimed in claim 10, wherein said data processing apparatus is configured to increase said predetermined time period if more than a predetermined number of said relative timings indicate that execution of said store-exclusive operation by said processor has occurred after said end of said predetermined time period after said processor has executed said load-exclusive operation.
12. The data processing apparatus as claimed in claim 10, wherein said data processing apparatus is configured to decrease said predetermined time period if more than a predetermined number of said relative timings indicate that execution of said store-exclusive operation by said processor has occurred more than a predetermined margin before said end of said predetermined time period after said processor has executed said load-exclusive operation.
13. A data processing apparatus comprising:
a processor configured to perform data processing operations by executing instructions, said data processing operations comprising accessing data values stored in a memory;
a cache configured to store local copies of a subset of said data values, wherein said cache is configured to maintain a status value for each local copy stored in said cache; and
an exclusive use monitor configured to monitor a selected memory location for accesses,
wherein said processor is configured to execute a load-exclusive operation, said load-exclusive operation comprising loading a first data value from a specified memory location and causing said exclusive use monitor to begin monitoring said specified memory location,
wherein said processor is configured to execute a store-exclusive operation, said store-exclusive operation comprising storing a second data value to said specified memory location if said exclusive use monitor indicates that said first data value at said specified memory location has not been modified since said load-exclusive operation was executed,
and wherein, when a local copy of said first data value is stored in said cache and said status value for said local copy of said first data value indicates that said processor has exclusive usage of said first data value, said data processing apparatus is configured to prevent modification of said status value for a predetermined time period after said processor has executed said load-exclusive operation,
a pending instruction queue populated by pending instructions which have been decoded but not yet executed, wherein said data processing apparatus is configured to prevent modification of said status value with reference to said pending instructions,

wherein said data processing apparatus is configured to identify a second set of pending instructions in said pending instruction queue when an instruction configured to cause execution of at least part of said load-exclusive operation is in said pending instruction queue, wherein execution of instructions of said second set of pending instructions will not affect said specified memory location, but said execution of instructions of said second set of pending instructions has potential to affect said local copy of said first data value stored in said cache,
and said data processing apparatus is configured to prevent said modification of said status value for said predetermined time period by preventing said second set of pending instructions from affecting said local copy of said first data value stored in said cache.
14. The data processing apparatus as claimed in claim 13, wherein said data processing apparatus is configured to cause said second set of pending instructions to stall for said predetermined time period.
15. The data processing apparatus as claimed in claim 14, wherein said data processing apparatus comprises a load-store configured to execute load instructions and store instructions, wherein said load-store comprises a set of slots to which each load or store instruction currently being handled is allocated, and wherein said load-store is configured to lock for said predetermined time period at least one said slot to which an instruction of said second set of pending instructions is allocated.
16. A data processing apparatus comprising:
means for performing data processing operations by executing instructions, said data processing operations comprising accessing data values stored in a memory;
means for storing local copies of a subset of said data values, wherein said means for storing is configured to maintain a status value for each local copy stored in said cache, said status value indicative of a usage status of said local copy with respect to said at least one other means for performing data processing operations; and
means for monitoring a selected memory location for accesses,
wherein said means for performing data processing operations is configured to execute a load-exclusive operation, said load-exclusive operation comprising loading a first data value from a specified memory location and causing said means for monitoring to begin monitoring said specified memory location,
wherein said means for performing data processing operations is configured to execute a store-exclusive operation, said store-exclusive operation comprising storing a second data value to said specified memory location if said exclusive use monitor indicates that said specified memory location has not been accessed since said load-exclusive operation was executed,
wherein, when a local copy of said first data value is stored in said means for storing and said status value for said local copy of said first data value indicates an exclusive usage status for said means for performing data processing operations, said data processing apparatus is configured to prevent modification of said status value for a predetermined time period after said means for performing data processing operations has executed said load-exclusive operation,
means for storing pending instructions which have been decoded but not yet executed, wherein said data processing apparatus is configured to prevent modification of said status value with reference to said pending instructions,
wherein said data processing apparatus is configured to identify a first set of pending instructions in said means for storing pending instructions when an instruction configured to cause execution of at least part of said load-exclusive operation is in said means for storing pending instructions,
wherein execution of said first set of pending instructions must be completed before execution of said store-exclusive operation completes, and said data processing apparatus is configured to prioritize execution of said first set of pending instructions.
17. A method of data processing comprising the steps of:
performing data processing operations by executing instructions in a processor, said data processing operations comprising accessing data values stored in a memory;
storing local copies of a subset of said data values in a cache, and maintaining a status value for each local copy stored in said cache, said status value indicative of a usage status of said local copy with respect to said at least one other processor;
executing a load-exclusive operation, said load-exclusive operation comprising loading a first data value from a specified memory location;
monitoring of said specified memory location for accesses;
executing a store-exclusive operation, said store-exclusive operation configured to cause said processor to store a second data value to said specified memory location if said monitoring step indicates that said specified memory location has not been accessed since said load-exclusive operation was executed;
when a local copy of said first data value is stored in said cache and said status value for said local copy of said first data value indicates an exclusive usage status for said processor, preventing modification of said status value for a predetermined time period after said processor has executed said load-exclusive operation,
populating a pending instruction queue by pending instructions which have been decoded but not yet executed;
preventing modification of said status value with reference to said pending instructions; and
identifying a first set of pending instructions in said pending instruction queue when an instruction configured to cause execution of at least part of said load-exclusive operation is in said pending instruction queue,
wherein execution of said first set of pending instructions must be completed before execution of said store-exclusive operation completes, and said data processing apparatus prioritizes execution of said first set of pending instructions.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

We claim:

1. A method of operating a radio packet data system, comprising:
communicating achievable data rate estimate information between an access terminal and an access network, the achievable data rate estimate information comprising scenarios corresponding to state combinations of a plurality of transmitters in the access network in which at least one of the plurality of transmitters is in the idle state in at least one of the scenarios.
2. A method of operating a radio packet data system, comprising:
communicating achievable data rate estimate information between an access terminal and an access network, the achievable data rate estimate infonmation comprising scenarios corresponding to all state combinations of a plurality of transmitters in the access network in which multiple ones of the plurality of transmitters are not in a serving state in a same one of the scenarios.
3. A method of operating a radio packet data system, comprising:
communicating achievable data rate estimate information between an access terminal and an access network, the achievable data rate estimate information comprising a scenario in which a first transmitter in the access network is in a serving state and a second transmitter in the access network is in an idle state.
4. The method of claim 3, wherein communicating the achievable data rate estimate information between the access terminal and the access network comprises:
determining a signal to interference ratio for communications between the access terminal and the first transmitter.
5. The method of claim 4, wherein determining the signal to interference ratio for communications between the access terminal and the first transmitter comprises:
determining the signal to interference ratio for communications between the access terminal and the first transmitter based on measurements taken during a pilot symbol transmission interval.
6. A method of operating a radio packet data system, comprising:
designating a transmitter in an access network as a serving transmitter for an access terminal; and
communicating achievable data rate estimate information between the access terminal and the access network, the achievable data rate estimate information comprising a scenario in which another transmitter in the access network from which the access terminal may obtain service is in an idle state.
7. The method of claim 6, wherein communicating the achievable data rate estimate information between the access terminal and the access network comprises:
determining a signal to interference ratio for communications between the access terminal and the serving transmitter.
8. The method of claim 7, wherein determining the signal to interference ratio for communications between the access terminal and the serving transmitter comprises:
determining the signal to interference ratio for communications between the access terminal and the serving transmitter based on measurements taken during a pilot symbol transmission interval.
9. A method of operating a radio packet data system, comprising:
receiving achievable data rate estimate information between ones of a plurality of access terminals and ones of a plurality of transmitters at an access network;
for each one of the plurality of access terminals, associating one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective access terminal;
determining whether respective ones of the plurality of transmitters have been associated with multiple ones of the plurality of access terminals; and
for each one of the plurality of transmitters that is associated with multiple ones of the plurality of access terminals, disassociating all but one of the multiple ones of the plurality of access terminals with the respective transmitter based on service scheduling factors respectively associated with the multiple ones of the plurality of access terminals.
10. The method of claim 9, further comprising:
discarding each one of the plurality of transmitters having one of the plurality of access terminals associated therewith; and
for each disassociated one of the plurality of access terminals, associating a non-discarded one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective disassociated access terminal.
11. The method of claim 9, wherein respective ones of the service scheduling factors comprise respective ratios of achievable data rate estimates to average received data rates of the multiple ones of the plurality of access terminals.
12. The method of claim 9, further comprising:
using blind detection of channel activity at the ones of the plurality of access terminals to generate the data rate estimation information.
13. A method of operating a radio packet data system, comprising:
performing the following for each of a plurality of scenarios corresponding to state combinations of a plurality of transmitters in an access network:
receiving achievable data rate estimate information between ones of a plurality of access terminals and ones of the plurality of transmitters at the access network;
for each one of the plurality of access terminals, associating one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective access terminal;
determining whether respective ones of the plurality of transmitters have been associated with multiple ones of the plurality of access terminals;
for each one of the plurality of transmitters that is associated with multiple ones of the plurality of access terminals, disassociating all but one of the multiple ones of the plurality of access terminals with the respective transmitter based on service scheduling factors respectively associated with the multiple ones of the plurality of access terminals; and
adding the achievable data rate estimates corresponding to any associated ones of the plurality of transmitters with ones of the plurality of access terminals to obtain a global throughput estimate for the respective one of the plurality of scenarios.
14. The method of claim 13, further comprising:
allocating bandwidth to the plurality of access terminals based on achievable data rate estimates associated with one of the plurality of scenarios having a highest global throughput estimate.
15. The method of claim 13, further comprising:
discarding each one of the plurality of transmitters having one of the plurality of access terminals associated therewith; and
for each disassociated one of the plurality of access terminals, associating a non-discarded one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective disassociated access terminal.
16. The method of claim 13, wherein respective ones of the service scheduling factors comprise respective ratios of achievable data rate estimates to average received data rates of the multiple ones of the plurality of access terminals.
17. A method of operating a radio packet data system, comprising:
performing the following for each of a plurality of access terminals:
designating one of a plurality of transmitters in an access network as a serving transmitter for the respective one of the plurality of access terminals; and
sending achievable data rate estimate information from the respective one of the plurality of access terminals to the access network, the achievable data rate information comprising scenarios corresponding to state combinations of at least one non-serving transmitter in the access network; then
performing the following for each of a plurality of scenarios corresponding to state combinations of the plurality of transmitters in the access network:
for each of a plurality of transmitters in the access network having achievable data rate estimates from multiple ones of the plurality of access terminals associated therewith, providing service to one of the plurality of access terminals associated therewith based on service scheduling factors.
18. The method of claim 17, wherein respective ones of the service scheduling factors comprise respective ratios of the achievable data rate estimates to average received data rates of the multiple ones of the plurality of access terminals.
19. A system for operating a radio packet data system, comprising:
means for communicating achievable data rate estimate information between an access terminal and an access network, the achievable data rate estimate information comprising scenarios corresponding to state combinations of a plurality of transmitters in the access network in which at least one of the plurality of transmitters is in the idle state in at least one of the scenarios; and
means for receiving the achievable data rate estimate information at the access network.
20. A system for operating a radio packet data system, comprising:
means for communicating achievable data rate estimate information between an access terminal and an access network, the achievable data rate estimate information comprising scenarios corresponding to all state combinations of a plurality of transmitters in the access network in which multiple ones of the plurality of transmitters are not in a serving state in a same one of the scenarios; and
means for receiving the achievable data rate estimate information at the access network.
21. A system for operating a radio packet data system, comprising:
means for communicating achievable data rate estimate information between an access terminal and an access network, the achievable data rate estimate information comprising a scenario in which a first transmitter in the access network is in a serving state and a second transmitter in the access network is in an idle state; and
means for receiving the achievable data rate estimate information at the access network.
22. The system of claim 21, wherein the means for communicating the achievable data rate estimate information between the access terminal and the access network comprises:
means for determining a signal to interference ratio for communications between the access terminal and the first transmitter.
23. The system of claim 22, wherein the means for determining the signal to interference ratio for communications between the access terminal and the first transmitter comprises:
means for determining the signal to interference ratio for communications between the access terminal and the first transmitter based on measurements taken during a pilot symbol transmission interval.
24. A system for operating a radio packet data system, comprising:
means for designating a transmitter in an access network as a serving transmitter for an access terminal; and
means for communicating achievable data rate estimate information between the access terminal and the access network, the achievable data rate estimate information comprising a scenario in which another transmitter in the access network from which the access terminal may obtain service is in an idle state.
25. The system of claim 24, wherein the means for communicating the achievable data rate estimate information between the access terminal and the access network comprises:
means for determining a signal to interference ratio for communications between the access terminal and the serving transmitter.
26. The system of claim 25, wherein the means for determining the signal to interference ratio for communications between the access terminal and the serving transmitter comprises:
means for determining the signal to interference ratio for communications between the access terminal and the serving transmitter based on measurements taken during a pilot symbol transmission interval.
27. A system for operating a radio packet data system, comprising:
means for receiving achievable data rate estimate information between ones of a plurality of access terminals and ones of a plurality of transmitters at an access network;
for each one of the plurality of access terminals, means for associating one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective access terminal;
means for determining whether respective ones of the plurality of transmitters have been associated with multiple ones of the plurality of access terminals; and
for each one of the plurality of transmitters that is associated with multiple ones of the plurality of access terminals, means for disassociating all but one of the multiple ones of the plurality of access terminals with the respective transmitter based on service scheduling factors respectively associated with the multiple ones of the plurality of access terminals.
28. The system of claim 27, further comprising:
means for discarding each one of the plurality of transmitters having one of the plurality of access terminals associated therewith; and
for each disassociated one of the plurality of access terminals, means for associating a non-discarded one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective disassociated access terminal.
29. The system of claim 27, wherein respective ones of the service scheduling factors comprise respective ratios of achievable data rate estimates to average received data rates of the multiple ones of the plurality of access terminals.
30. The system of claim 27, further comprising:
means for using blind detection of channel activity at the ones of the plurality of access tenninals to generate the data rate estimation information.
31. A system for operating a radio packet data system, comprising:
means for perfonming for each of a plurality of scenarios corresponding to state combinations of a plurality of transmitters in an access network, the means for performing comprising:
means for receiving achievable data rate estimate information between ones of a plurality of access terminals and ones of the plurality of transmitters at the access network;
for each one of the plurality of access terminals, means for associating one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective access terminal;
means for determining whether respective ones of the plurality of transmitters have been associated with multiple ones of the plurality of access terminals;
for each one of the plurality of transmitters that is associated with multiple ones of the plurality of access terminals, means for disassociating all but one of the multiple ones of the plurality of access terminals with the respective transmitter based on service scheduling factors respectively associated with the multiple ones of the plurality of access terminals; and
means for adding the achievable data rate estimates corresponding to any associated ones of the-plurality of transmitters with ones of the plurality of access terminals to obtain a global throughput estimate for the respective one of the plurality of scenarios.
32. The system of claim 31, further comprising:
means for allocating bandwidth to the plurality of access tenminals based on achievable data rate estimates associated with one of the plurality of scenarios having a highest global throughput estimate.
33. The system of claim 31, further comprising:
means for discarding each one of the plurality of transmitters having one of the plurality of access terminals associated therewith; and
for each disassociated one of the plurality of access terminals, means for associating a non-discarded one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective disassociated access terminal.
34. The system of claim 31, wherein respective ones of the service scheduling factors comprise respective ratios of achievable data rate estimates to average received data rates of the multiple ones of the plurality of access terminals.
35. A system for operating a radio packet data system, comprising:
first means for performing for each of a plurality of access terminals, the first means for performing comprising:
means for designating one of a plurality of transmitters in an access network as a serving transmitter for the respective one of the plurality of access terminals;
means for sending achievable data rate estimate information from the respective one of the plurality of access terminals to the access network, the achievable data rate estimate information comprising scenarios corresponding to state combinations of at least one non-serving transmitter in the access network; and
second means, responsive to the means for sending, for performing for each of a plurality of scenarios corresponding to state combinations of the plurality of transmitters in the access network, the second means for performing comprising:
for each of a plurality of transmitters in the access network having achievable data rate estimates from multiple ones of the plurality of access terminals associated therewith, means for providing service to one of the plurality of access terminals associated therewith based on service scheduling factors.
36. The system of claim 35, wherein respective ones of the service scheduling factors comprise respective ratios of the achievable data rate estimates to average received data rates of the multiple ones of the plurality of access terminals.
37. A computer program product configured to operate a radio packet data system, comprising:
a computer readable storage medium having computer readable program code embodied therein, the computer readable program code comprising:
computer readable program code configured to communicate achievable data rate estimate information between an access terminal and an access network, the achievable data rate estimate information comprising scenarios corresponding to state combinations of a plurality of transmitters in the access network in which at least one of the plurality of transmitters is in the idle state in at least one of the scenarios.
38. A computer program product configured to operate a radio packet data system, comprising:
a computer readable storage medium having computer readable program code embodied therein, the computer readable program code comprising:
computer readable program code configured to communicate achievable data rate estimate information between an access terminal and an access network, the achievable data rate estimate information comprising scenarios corresponding to all state combinations of a plurality of transmitters in the access network in which multiple ones of the plurality of transmitters are not in a serving state in a same one of the scenarios.
39. A computer program product configured to operate a radio packet data system, comprising:
a computer readable storage medium having computer readable program code embodied therein, the computer readable program code comprising:
computer readable program code configured to communicate achievable data rate estimate information between an access terminal and an access network, the achievable data rate estimate information comprising a scenario in which a first transmitter in the access network is in a serving state and a second transmitter in the access network is in an idle state.
40. The computer program product of claim 39, wherein the computer readable program code configured to communicate the achievable data rate estimate information between the access terminal and the access network comprises:
computer readable program code configured to determine a signal to interference ratio for communications between the access terminal and the first transmitter.
41. The computer program product of claim 40, wherein the computer readable program code configured to determine the signal to interference ratio for communications between the access terminal and the first transmitter comprises:
computer readable program code configured to determine the signal to interference ratio for communications between the access terminal and the first transmitter based on measurements taken during a pilot symbol transmission interval.
42. A computer program product configured to operate a radio packet data system, comprising:
a computer readable storage medium having computer readable program code embodied therein, the computer readable program code comprising:
computer readable program code configured to designate a transmitter in an access network as a serving transmitter for an access terminal; and
computer readable program code configured to communicate achievable data rate estimate information between the access terminal and the access network, the achievable data rate estimate information comprising a scenario in which another transmitter in the access network from which the access terminal may obtain service is in an idle state.
43. The computer program product of claim 42, wherein the computer readable program code configured to communicate the achievable data rate estimate information between the access terminal and the access network comprises:
computer readable program code configured to determine a signal to interference ratio for communications between the access terminal and the serving transmitter.
44. The computer program product of claim 43, wherein the computer readable program code configured to determine the signal to interference ratio for communications between the access terminal and the serving transmitter comprises:
computer readable program code configured to determine the signal to interference ratio for communications between the access terminal and the serving transmitter based on measurements taken during a pilot symbol transmission interval.
45. A computer program product configured to operate a radio packet data system, comprising:
a computer readable storage medium having computer readable program code embodied therein, the computer readable program code comprising:
computer readable program code configured to receive achievable data rate estimate information between ones of a plurality of access terminals and ones of a plurality of transmitters at an access network;
for each one of the plurality of access tenrinals, computer readable program code configured to associate one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective access terminal;
computer readable program code configured to determine whether respective ones of the plurality of transmitters have been associated with multiple ones of the plurality of access terminals; and
for each one of the plurality of transmitters that is associated with multiple ones of the plurality of access terminals, computer readable program code configured to disassociate all but one of the multiple ones of the plurality of access terminals with the respective transmitter based on service scheduling factors respectively associated with the multiple ones of the plurality of access terminals.
46. The computer program product of claim 45, further comprising:
computer readable program code configured to discard each one of the plurality of transmitters having one of the plurality of access terminals associated therewith; and
for each disassociated one of the plurality of access terminals, computer readable program code configured to associate a non-discarded one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective disassociated access tenminal.
47. The computer program product of claim 45, wherein respective ones of the service scheduling factors comprise respective ratios of achievable data rate estimates to average received data rates of the multiple ones of the plurality of access terminals.
48. The computer program product of claim 45, further comprising:
computer readable program code for using blind detection of channel activity at the ones of the plurality of access terminals to generate the data rate estimation information.
49. A computer program product configured to operate a radio packet data system, comprising:
a computer readable storage medium having computer readable program code embodied therein, the computer readable program code comprising:
computer readable program code configured to perform for each of a plurality of scenarios corresponding to state combinations of a plurality of transmitters in an access network, the computer readable program code configured to perform comprising:
computer readable program code configured to receive achievable data rate estimate information between ones of a plurality of access terminals and ones of the plurality of transmitters at the access network;
for each one of the plurality of access terminals, computer readable program code configured to associate one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective access terminal;
computer readable program code configured to determine whether respective ones of the plurality of transmitters have been associated with multiple ones of the plurality of access terminals;
for each one of the plurality of transmitters that is associated with multiple ones of the plurality of access terminals, computer readable program code configured to disassociate all but one of the multiple ones of the plurality of access terminals with the respective transmitter based on service scheduling factors respectively associated with the multiple ones of the plurality of access terminals; and
computer readable program code configured to add the achievable data rate estimates corresponding to any associated ones of the plurality of transmitters with ones of the plurality of access terminals to obtain a global throughput estimate for the respective one of the plurality of scenarios.
50. The computer program product of claim 49, further comprising:
computer readable program code configured to allocate bandwidth to the plurality of access terminals based on achievable data rate estimates associated with one of the plurality of scenarios having a highest global throughput estimate.
51. The computer program product of claim 49, further comprising:
computer readable program code configured to discard each one of the plurality of transmitters having one of the plurality of access terminals associated therewith; and
for each disassociated one of the plurality of access terminals, computer readable program code configured to associate a non-discarded one of the plurality of transmitters having a highest achievable data rate estimate associated therewith with the respective disassociated access terminal.
52. The computer program product of claim 49, wherein respective ones of the service scheduling factors comprise respective ratios of achievable data rate estimates to average received data rates of the multiple ones of the plurality of access terminals.
53. A computer program product configured to operate a radio packet data system, comprising:
a computer readable storage medium having computer readable program code embodied therein, the computer readable program code comprising:
first computer readable program code configured to perform for each of a plurality of access terminals, the first computer readable program code configured to perform comprising:
computer readable program code configured to designate one of a plurality of transmitters in an access network as a serving transmitter for the respective one of the plurality of access terminals;
computer readable program code configured to send achievable data rate estimate information from the respective one of the plurality of access terminals to the access network, the achievable data rate information comprising scenarios corresponding to state combinations of at least one non-serving transmitter in the access network; and
second computer readable program code, responsive to the computer readable program code configured to send, configured to perform for each of a plurality of scenarios corresponding to state combinations of the plurality of transmitters in the access network, the second computer readable program code configured ot perform comprising:
for each of a plurality of transmitters in the access network having achievable data rate estimates from multiple ones of the plurality of access terminals associated therewith, computer readable program code configured to providing service to one of the plurality of access terminals associated therewith based on service scheduling factors.
54. The computer program product of claim 53, wherein respective ones of the service scheduling factors comprise respective ratios of the achievable data rate estimates to average received data rates of the multiple ones of the plurality of access terminals.

1. A slipcover arrangement for a dining room chair having a seat with a seat width and a seat depth, a back rising from a rear end of the seat and having a back width and a back height, and at least one leg for maintaining the seat at a seat height, the arrangement comprising:
a pair of seat panels adapted to cover at least portions of each side of a seat to be covered while leaving an uncovered area on the seat between the seat panels in the direction of the seat width, each seat panel having a length for extending a full seat depth from the back of a chair to be covered, to a point below a front end of the seat to be covered;
a chasuble having a width to cover the uncovered area of the seat to be covered, and a total length for extending from a point below the front end of the seat to be covered, across the seat depth, up along a front surface of the back of the chair to be covered, across a top of the back and at least down part of a rear surface of the back;
wrapping means connected to the chasuble for extending around at least part of the back for holding the chasuble over the seat panels and to the chair to be covered; and
a skirt for engaging around the seat to be covered and for extending from the seat down a portion of the seat height, the skirt defining a front gap that is covered or spanned by a jumper portion of the chasuble.
2. The slipcover of claim 1, wherein each seat panel has a width of less than the seat width, and a length of more than the seat depth.
3. The slipcover of claim 1, wherein each seat panel includes at least one slit for receiving a portion of a dining room chair arm connected to the seat to be covered.
4. The slipcover of claim 1, the skirt comprising a pair of skirt portions with a pair of front connectors for connecting front parts of the skirt portions to each other to form the gap, and a pair of rear connectors for connecting rear parts of the skirt portions.
5. The slipcover of claim 1, wherein the chasuble comprises the jumper portion for covering a front of the chair to be covered from the front end of the seat down to the point below the front end of the seat to be covered, a seat portion for extending across the seat depth, a first back portion for extending up along the front surface of the back of the chair to be covered and across the top of the back, and a second back portion for extending down a rear surface of the back.
6. The slipcover of claim 5, wherein the chasuble has a waist extending near a junction between the seat portion and the first back portion, the wrapping means includes a band at the waist for securing the waist of the chasuble to the back of the chair to be covered.
7. The slipcover of claim 5, wherein the chasuble includes a pair of side wings extending from opposite sides of the first back portion for wrapping around the back of the chair to be covered, and at least one connecter for connected the wings to each other at the rear surface of the back, the second back portion being adapted to cover the connected wings at the rear surface of the back.
8. The slipcover of claim 7, wherein each side wing comprises an upper wing for wrapping around an upper part of the back and a lower wing for engaging around a lower part of the back so that an arm of the chair to be covered which is connected to the back is accommodated between the upper and lower wings, and connectors for connecting the upper wings to each other and for connecting the lower wings to each other.
9. The slipcover of claim 8, wherein the chasuble includes a corner portion connected to, and extending downwardly from each lower wing for extending around rear corners of the seat to be covered.
10. The slipcover of claim 1, wherein the wrapping means comprise a plurality of elastic tabs for connecting portions of the chasuble that are wrapped around to the rear surface of the back, the chasuble being sufficiently long so that a portion of the chasuble covers the tabs at the rear surface of the back.
11. The slipcover of claim 1, including connectors for connecting the jumper portion of the chasuble to the skirt on opposite sides of the gap.
12. The slipcover of claim 1, wherein the pair of seat panels are fixed to opposite sides of a seat portion of the chasuble.
13. A slipcover arrangement for a dining room chair having a seat with a seat width and a seat depth, a back rising from a rear end of the seat and having a back width and a back height, and at least one leg for maintaining the seat at a seat height, the arrangement comprising:
a pair of seat panels adapted to cover at least portions of each side of a seat to be covered while leaving an uncovered area on the seat between the seat panels in the direction of the seat width, each seat panel having a length for extending a full seat depth from the back of a chair to be covered, to a point below a front end of the seat to be covered;
a chasuble having a width to cover the uncovered area of the seat to be covered, and a total length for extending from a point below the front end of the seat to be covered, across the seat depth, up along a front surface of the back of the chair to be covered, across a top of the back and down a rear surface of the back;
wrapping means connected to the chasuble for extending around at least part of the back for holding the chasuble over the seat panels and to the chair to be covered;
each seat panel have a width of less than the seat width, and a length of more than the seat depth, each seat panel includes at least one slit for receiving a portion of a dining room chair arm connected to the seat to be covered; and
a skirt for engaging around the seat to be covered and for extending from the seat down a portion of the seat for holding the chasuble and the side panels to the chair, the skirt defining a front gap that is covered by a jumper portion of the chasuble.
14. The slipcover of claim 13, wherein the skirt comprises a pair of skirt portions with a pair of front connectors for connecting front parts of the skirt portions to each other to form the gap covered by the jumper portion and a pair of rear connectors for connecting rear parts of the skirt portions to each other.
15. The slipcover of claim 14, wherein the chasuble comprises the jumper portion for covering a front of the chair to be covered from the front end of the seat down to the point below the front end of the seat to be covered, a seat portion for extending across the seat depth, a first back portion for extending up along the front surface of the back of the chair to be covered and across the top of the back, and a second back portion for extending down a rear surface of the back.
16. The slipcover of claim 15, wherein the chasuble has a waist extending near a junction between the seat portion and the first back portion, the wrapping means include a band at the waist for securing the waist of the chasuble to the back of the chair to be covered.
17. The slipcover of claim 16, wherein the chasuble includes a pair of side wings extending from opposite sides of the first back portion for wrapping around the back of the chair to be covered, and at least one connecter for connecting the wings to each other at the rear surface of the back, the second back portion being adapted to cover the connected wings at the rear surface of the back.
18. The slipcover of claim 17, wherein each side wing comprises an upper wing for wrapping around an upper part of the back and a lower wing for engaging around a lower part of the back, so that an arm of the chair to be covered which is connected to the back is accommodated between the upper and lower wings, and connectors for connecting the upper wings to each other and for connecting the lower wings to each other, the chasuble including a corner portion connected to, and extending downwardly from each lower wing for extending around rear corners of the seat to be covered.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

What is claimed:

1. A compound selected from the formulas I or II:

186
wherein:
R1 is selected from H, OH or the C1-C12 esters (straight chain or branched) or C1-C12 (straight chain or branched or cyclic) alkyl ethers thereof, or halogens; or C1-C4 halogenated ethers including triflouromethyl ether and trichioromethyl ether
R2, R3, R4, R5, and R6 are independently selected from H, OH or the C1-C12 esters (straight chain or branched) or C1-C12 alkyl ethers (straight chain or branched or cyclic) thereof, halogens, or C1 -C4 halogenated ethers including trifiouromethyl ether and trichloromethyl ether, cyano, C1-C6alkyl (straight chain or branched), or trifluoromethyl, with the proviso that, when R1 is H, R2 is not OH
X is selected from H, C1-C6 alkyl, cyano, nitro, trifluoromethyl, halogen;
n is2or3;
Y is selected from:
a) the moiety:

187
wherein R7 and R8 are independently selected from the group of H, C1-C6 alkyl, or phenyl optionally substituted by CN, C1-C6 alkly (straight chain or branched), C1-C6 alkoxy (straight chain or branched), halogen, OH, CF3, or OCF3;
b) a five-membered saturated, unsaturated or partially unsaturated heterocycle containing up to two heteroatoms selected from the group consisting of -O-, NH, N(C1C4 alkyl)-, N, and S(O)m-, wherein m is an integer of from 0-2, optionally substituted with 1-3 substituents independently selected from the group consisting of hydrogen, hydroxyl, halo, C1-C4 alkyl, trihalomethyl, C1-C4 alkoxy, trihalomethoxy, C1-C4 acyloxy, C1-C4 alkylthio, C1-C4 alkylsulfinyl, C1-C4 alkylsulfonyl, hydroxy (C1-C4)alkyl, CO2H, CN, CONHR1-, NH2-, C1-C4 alkylamino, di(C1-C4)alkylanino, NHSO2R1-, NHCOR1-, NO2, and phenyl optionally substituted with 1-3 (C1-C4)alkyl;
c) a six-membered saturated, unsaturated or partially unsaturated heterocycle containing up to two heteroatoms selected from the group consisting of O, NH, N(C1C4 alkyl)-, N, and S(O)m-, wherein m is an integer of from 0-2, optionally substituted with 1-3 substituents independently selected from the group consisting of hydrogen, hydroxyl, halo, C1-C4 alkyl, trihalomethyl, C1-C4 alkoxy, trihalomethoxy, C1-C4 acyloxy, C1-C4 alkylthio, C1-C4 alkylsulfinyl, C1-C4 alkylsulfonyl, hydroxy (C1-C4)alkyl, CO2H-, CN, CONHR1-, NH2-, C1-C4 alkylamino, di(C1-C4)alkylamino, NHSO2R1, NHCOR1-, NO2, and phenyl optionally substituted with 1-3 (C1-C4)alkyl;
d) a seven-membered saturated, unsaturated or partially unsaturated heterocycle containing up to two heteroatoms selected from the group consisting of O, NH, N(C1C4 alkyl)-, N, and S(O)m-, wherein m is an integer of from 0-2, optionally substituted with 1-3 substituents independently selected from the group consisting of hydrogen, hydroxyl, halo, C1-C4 alkyl, trihalomethyl, C1-C4 alkoxy, trihalomethoxy, C1-C4 acyloxy, C1-C4 alkylthio, C1-C4 alkylsulfinyl, C1-C4 alkylsulfonyl, hydroxy (C1-C4)alkyl, CO2H-, CN, CONHR1-, NH2-, C1-C4 alkylamino, di(C1-C4)alkylamino, NHSO2R1-, NHCOR1-, NO2, and phenyl optionally substituted with 1-3 (C1-C4)alyl;; or
e) a bicyclic heterocycle containing from 6-12 carbon atoms either bridged or fused and containing up to two heteroatoms selected from the group consisting of O, NH, N(C1C4 alkyl)-, and S(O)m-, wherein m is an integer of from 0-2, optionally substituted with 1-3 substituents independently selected from the group consisting of hydrogen, hydroxyl, halo, C1-C4 alkyl, trihalomethyl, C1-C4 alkoxy, trihalomethoxy, C1-C4 acyloxy, C1-C4 alkylthio, C1-4 alkylsulfinyl, C1-C4 alkylsulfonyl, hydroxy (C1-C4)alkyl, CO2H-, CN, CONHR1-, NH2-, C1-4 alkylamino, di(C1-C4)alkyiamino, NHSO2R1-, NHCOR1-, NO2, and phenyl optionally substituted with 1-3 (C1-C4) alkyl; and the pharmaceutically acceptable salts thereof.
2. A compound of claim 1 wherein:
R1 is selected from H, OH or the C1-C4 esters or alkyl ethers thereof, halogen;
R2, R3, R4, R5, and R6 are independently selected from H, OH or the C1-C4 esters or alkyl ethers thereof, halogen, cyano, C1-C6 alkyl, or trifluoromethyl, with the proviso that, when R1 is H, R2 is not OH;
X is selected from H, C1-C6 alkyl, cyano, nitro, triflouromethyl, halogen;
Y is the moiety

188
R7 and R8 are selected independently from H, C1-C6 alkyl, or combined by -(CH2)p-, wherein p is an integer of from 2 to 6, so as to form a ring, the ring being optionally substituted by up to three substituents selected from the group of hydrogen, hydroxyl, halo, C1-C4 alkyl, trihalomethyl, C1-C4 alkoxy, trihalomethoxy, C-C4 alkylthio, C1-C4 alkylsulfinyl, C1-C4 aLkylsulfonyl, hydroxy (C1-C4)alkyl, CO2H, CN, CONH(C1-C4), NH2, C1-C4 allylamino, di(C1-C4)alkylamino, NHSO2(C1-C4), NHCO(C1-C4), and NO2; or a pharmaceutically acceptable salt thereof.
3. A compound of claim 1 wherein:
R1 is OH;
R2, R3, R4, R5, and R6 are independently selected from H, OH or the C1-C4 esters or alkyl ethers thereof, halogen, cyano, C1-C6 alkyl, or trifluoromethyl, with the proviso that, when R1 is H, R2 is not OH;
X is selected from the group of Cl, NO2, CN, CF3, or CH3;
Y is the moiety

189
R7 and R8 are concatenated together as -(CH2)r-, wherein r is an integer of from 4 to 6, to form a ring optionally substituted by up to three subsituents selected from the group of hydrogen, hydroxyl, halo, C1-C4 alkyl, trihalomethyl, C1-C4 alkoxy, trihalomethoxy, C1-C4 alkylthio, C1-C4 alkylsulfinyl, C1-C4 alkylsulfonyl, hydroxy (C1-C4)alkyl, CO2H, CN, CONH(C1-C4), NH2, C1-C4 alkylamino, di(C1-C4)alkylamino, NHSO2(C1-C4), NHCO(C1-C4), and NO2; or a pharmaceutically acceptable salt thereof.
4. A compound of claim 1 which is 5-Benzyloxy-2-(4-ethoxy-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
5. A compound of claim 1 which is 5-Benzyloxy-2-phenyl-3-methyl-1-4 (2-azepan-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
6. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-methyl-1-4-(2-azepan-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
7. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-methyl-1-4-(2-diisopropylamino-1-ylethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
8. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-methyl-1-4-(2-butyl-methylamino-1-ylethoxy)-benzyl- 1H-indole or a pharmaceutically acceptable salt thereof.
9. A compound of claim 1 which is 5-Benzyloxy-2-(4benzyloxy-phenyl)-3-methyl-1-4 dimethylamino)-ethoxy-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
10. A compound of claim 1 which is 5-Benzyloxy-2-(4benzyloxy-phenyl)-3-methyl-1-(4-(2-(2-methyl-piperidin-1-yl)-ethoxy-benyl )-1H-indole or a pharmaceutically acceptable salt thereof.
11. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-methyl-1 – (4-2-(3-methyl-piperidin-1 -yl)-ethoxy-benzyl)-1H-indole or a pharmaceutically acceptable salt thereof.
12. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-methyl-1- (4-2-(4-methyl-piperidin-1 -yl)-ethoxy-benzyl)-1H-indole or a pharmaceutically acceptable salt thereof.
13. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-methyl-1-4-2-((cis)-2,6-Dimethyl-piperidin-1-yl)-ethoxy-benzyl 1H-indole or a pharmaceutically acceptable salt thereof.
14. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-methyl-4-2-(1,3,3-trimethyl-6-aza-bicyclo3.2.loct-6-yl)-ethoxy-benzyl -1H -indole or a pharmaceutically acceptable salt thereof.
15. A compound of claim 1 which is (1S, 4R)-5-Benzyloxy-2 -(4 -benzyloxy-phenyl)-3-methyl(4-2-(2-Aza-bicyclo 2.2.1 hept-2-yl)-ethoxy-benzyl -1H-indole or a pharmaceutically acceptable salt thereof.
16. A compound of claim 1 which is 5-Benzyloxy-2-(4-flouro-phenyl)-3-methyl-1-4-(2-azepan-1 -yl-ethoxy)-benzyl- 1H-indole or a pharmaceutically acceptable salt thereof.
17. A compound of claim 1 which is 5-Benzyloxy-2-(4-flouro-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
18. A compound of claim 1 which is 5-Benzyloxy-2-(4-chloro-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
19. A compound of claim 1 which is 5-Benzyloxy-2-3,4methylenedioxy-phenyl-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
20. A compound of claim 1 which is 5-Benzyloxy-2-4isopropoxy-phenyl-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceuically acceptable salt thereof.
21. A compound of claim 1 which is 5-Benzyloxy-2-4methyl-phenyl-3-methyl-1-4(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
22. A compound of claim 1 which is 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-5-benzyloxy-2-(3-benzyloxy-phenyl)-3-methyl-1H-indole or a pharmaceutically acceptable salt thereof.
23. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-3-fluoro-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
24. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-3-fluoro-phenyl)-3-methyl-1-4-(2-azepan-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
25. A compound of claim 1 which is 5-Benzyloxy-2-(3-methoxy-phenyl-1-4(2-piperidin-1-yl-ethoxy)-benzyl-3-methyl-1H-indole or a pharmaceutically acceptable salt thereof.
26. A compound of claim 1 which is 5-Benzyloxy-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-2-(4-trifluoromethoxy-phenyl)-1H-indole or a pharmaceutically acceptable salt thereof.
27. A compound of claim 1 which is (2-4-5-Benzyloxy-2-4-benzyloxy-phenyl)-3-methyl-indol-1-yl-methyl-phenoxy-ethyl)-cyclohexyl-amine or a pharmaceutically acceptable salt thereof.
28. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-methyl-1-4-methylpiperazin-1-yl)-ethoxy-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
29. A compound of claim 1 which is 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-5-benzyloxy-2-(3-methoxy-phenyl)-3-methyl- 1H-indole or a pharmaceutically acceptable salt thereof.
30. A compound of claim 1 which is 4-(3-Methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole(HCl).
31. A compound of claim 1 which is 4-(3-Methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-2-yl-phenol hydrochloride (HCl).
32. A compound of claim 1 which is 3-Methyl-2-phenyl-1-4(2-piperidine-1-yl-ethoxy)-benzyl-1H-indol-5-ol (HCl).
33. A compound of claim 1 which is 4-5-Methoxy-3-methyl-1-4-2-(piperidin-1-yl)-ethoxy-benzyl-1 H -indol-2-yl)-phenol or a pharmaceutically acceptable salt thereof.
34. A compound of claim 1 which is 2-(4-methoxy-phenyl)-3-methyl-1-4-2-(piperidin-1-yl)-ethoxy-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
35. A compound of claim 1 which is 5-Methoxy-2-(4-methoxy-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole (HCL).
36. A compound of claim 1 which is 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-5-methoxy-2-(4-methoxy-phenyl)-3-methyl-1H-indole (HCL).
37. A compound of claim 1 which is 2-(4-Ethoxy-phenyl)-3-methyl-1-4 -(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
38. A compound of claim 1 which is 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-2-(4-ethoxy-phenyl)-3-methyl-1H-indol-5-ol or a phanraceutically acceptable salt thereof.
39. A compound of claim 1 which is 4-5-Fluoro-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-2-yl-phenol (HCl).
40. A compound of claim 1 which is 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-3-methyl-2-phenyl-1H-indol-5-ol (HCl).
41. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-3-methyl-1-4-(2-pyrollidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
42. A compound of claim 1 which is 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-2-(4hydroxy-phenyl)-3-methyl-1H-indol-5-ol (HCl).
43. A compound of claim 1 which is l-4(2-Azepan-1-yl-ethoxy)-benzyl-2-(4hydroxy-phenyl)-3-methyl-1H-indol-5-ol Acetate Salt.
44. A compound of claim 1 which is 1-4-(2-Azocan-1-yl-ethoxy)-benzyl-2-(4hydroxy-phenyl)-3-methyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
45. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-3-methyl-1-4-(2-dimethyl-1-yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
46. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-3-methyl-1-4-(2-diethyl-1-yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
47. A compound of claim 1 which is 1-4-(2-Dipropylamino-ethoxy)-benzyl-2-(4-hydroxy-phenyl)-3-methyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
48. A compound of claim 1 which is 1-4(2-Dibutylamino-ethoxy)-benzyl-2-(4-hydroxy-phenyl)-3-methyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
49. A compound of claim 1 which is 1-4-(2-Diisopropylaminoethoxy)-benzyl-2-(4-hydroxy-phenyl)-3-methyl- 1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
50. A compound of claim 1 which is 1-4-2-(Butyl-methyl-ammio)-ethoxy-benzyl -2-(4-hydroxy-phenyl)-3-methyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
51. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-3-methyl-1-4-2-(2-methyl-piperidin-1-yl)-ethoxy-benzyl- 1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
52. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-3-methyl-1-4-2-(3-methyl-piperdin-1-yl)-ethoxy-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
53. A compound of claim 1 which is 2-(4Hydroxy-phenyl)-3-methyl-1-4-2-(4-methyl-piperidin-1-yl)-ethoxy-benzyl-1H-indol-5-ol (HCl).
54. A compound of claim 1 which is 1-4-2-(3,3-Dimethyl-piperidin-1-yl)-ethoxy-benzyl-2-(4-hydroxy-phenyl)-3-methyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
55. A compound of claim 1 which is 1-4-2-((cis)-2,6Dimethyl-piperidin-1-yl)ethoxy-benzyl-2-(4-hydroxy-phenyl)-3-methyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
56. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-1-4-2-(4-hydroxy-piperidin-1 -yl)-ethoxy-benzyl-3-methyl- 1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
57. A compound of claim 1 which is (1S,4R)-1-4-2-(2-Aza-bicyclo 2.2.1 hept-2-yl)-ethoxy-benzyl-2-(4-hydroxy-phenyl)-3-methyl- 1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
58. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-3-methyl-1-4-2-(1,3,3-trimethyl-6-aza-bicyclo3.2.1oct-6yl)-ethoxy-benzyl-1H-indol-5-ol or a phanmaceutically acceptable salt thereof.
59. A compound of claim 1 which is 2-(4Fluoro-phenyl)-3-methyl-1-4-(2-piperidine-1-yl-ethoxy)-benzyl-1H-indol-5-ol (HCl).
60. A compound of claim 1 which is 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-2-(4fluoro-phenyl)-3-methyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
61. A compound of claim 1 which is 2-(3-Methoxy4-hydroxy-phenyl)-3-methyl- l-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol (HCl).
62. A compound of claim 1 which is 2-Benzo1,3dioxol-5-yl-3-methyl-1-4(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol (HCL).
63. A compound of claim 1 which is 2-(4-Isopropoxy-phenyl)-3-methyl-1-4-(2-piperidin-1 -yl-ethoxy)-benzyl- 1H-indol-5-ol (HCl).
64. A compound of claim 1 which is 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-2-(4-isopropoxy-phenyl)-3-methyl-1H-indo-5-ol (HCl).
65. A compound of claim 1 which is 2-(4-Cyclopenyloxy-phenyl)-3-methyl-1-4-(2-piperidin-1 -yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
66. A compound of claim 1 which is 3-Methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-2-(4-trifluoromethyl-phenyl)-l1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
67. A compound of claim 1 which is 3-Methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-2-p-tolyl-)-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
68. A compound of claim 1 which is 2-(4Chloro-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol (HCL).
69. A compound of claim 1 which is 2-(2,4-Dimethoxy-phenyl)-3-methyl-1-4(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
70. A compound of claim 1 which is 2-(3-Hydroxy-phenyl)-3-methyl-1-(4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
71. A compound of claim 1 which is 1-4(2-Azepan-1-yl-ethoxy)-benzyl-2-(3-hydroxy-phenyl)-3-methyl-1H-indole-5-ol or a pharmaceutically acceptable salt thereof.
72. A compound of claim 1 which is 2-(3-Fluoro4hydroxy-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
73. A compound of claim 1 which is 2-(3-Fluoro-4-hydroxy-phenyl)-3-methyl-1-4(azepan-1 -yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
74. A compound of claim 1 which is 2-(3-Methoxy-phenyl)-3-methyl-1-4-(2-piperidin-1 -yl-ethoxy)-benzyl- 1H-indole-5-ol or a pharmaceutically acceptable salt thereof.
75. A compound of claim 1 which is 3-Methyl-1-4(2-piperidin-1-yl-ethoxy)-benzyl-2-(4-trifiuoromethoxy-phenyl)-1H-indole-5-ol or a pharmaceutically acceptable salt thereof.
76. A compound of claim 1 which is 3-Chloro-2-(4hydroxy-phenyl)-1-4-(2-pyrrolidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol (HCl).
77. A compound of claim 1 which is Removal of benzyl ethers to render 3-Chloro-2-(4hydroxy-phenyl)-1-4(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol (HCl).
78. A compound of claim 1 which is 3-Chloro2-(4-hydroxy-phenyl)-1-4-(2-azepan-1-yl-ethoxy)-benzyl-1H-indol-5-ol (HCl).
79. A compound of claim 1 which is 3-Chloro-2-(4-hydroxy-2-methyl-phenyl)-1-4-(2-piperidin-1-yl-ethoxy)-benzyl- 1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
80. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-3-ethyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol (HCl).
81. A compound of claim 1 which is 5-Hydroxy-2-(4-Hydroxy-phenyl)-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole-3-arbonitrile (HCl).
82. A compound of claim 1 which is 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-5-hydroxy-2-(4-hydroxy-phenyl)-1H-indole-3-abonitiie (HCl).
83. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-chloro-1-4-(2-piperidin-1-yl-ethoxy)-benzyl- 1H-indole or a pharmaceutically acceptable salt thereof.
84. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-chloro-1-4-(2-azepan-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
85. A compound of claim 1 which is 5-Benzyloxy-2-(2-methyl-4-benzyloxy-phenyl)-3-chloro-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
86. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-ethyl-1-4(2-piperidin -1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
87. A compound of claim 1 which is 5-Benzyloxy-2-(4benzyloxy-phenyl)-3-cyano-1-4-(2-piperidin-1-yl-ethoxy)-benzyl- 1H-indole or a pharmaceutically acceptable salt thereof.
88. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-cyano-1-4-(2-azepan-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
89. A compound of claim 1 which is Di-propionate of 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-2-(4-hydroxy-phenyl)-3-methyl-1H-indol-5-ol (HCl).
90. A compound of claim 1 which is Di-pivalate of 1-4-(2-Azepan-1-yl-ethoxy)-benzyl-2-(4-hydroxy-phenyl)-3-methyl-1H-indol-5-ol (HCl).
91. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-1-4-(3-piperidin-1-yl-propoxy)-benzyl-3-methyl-1H-indole or a pharmaceutically acceptable salt thereof.
92. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-3-methyl-1-4–3-(piperidin-1 -yl)-propoxy-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
93. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-1-3-methoxy-4-(2-piperidin-1-yl-ethoxy)-benzyl-3-methyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
94. A compound of claim 1 which is 2-(4-Hydroxy-phenyl)-1-3-methoxy-4-(2-azepan-1-yl-ethoxy)-benzyl-3-methyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
95. A compound of claim 1 which is 5-Benzyloxy-2-(4benzyloxy-phenyl)-3-methyl-1-3-Methoxy-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
96. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-methyl-1-2-Methoxy4(2-azepan-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
97. A compound of claim 1 which is Di-pivalate ester of 2-(4Hydroxy-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
98. A compound of claim 1 which is 5-Benzyloxy-2-(4-benzyloxy-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indole or a pharmaceutically acceptable salt thereof.
99. A compound of claim 1 which is 5-Benzyloxy-2-(3-benzyloxy-phenyl)-3-methyl-1-4(2-piperidin-1-yl-ethoxy)-benzyl- 1H-indole or a pharmaceutically acceptable salt thereof.
100. A compound of claim 1 which is 2-(4Hydroxy-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol or a pharmaceutically acceptable salt thereof.
101. A compound of claim 1 which is 2-(4Hydroxy-phenyl)-3-methyl-1-4-(2-piperidin-1-yl-ethoxy)-benzyl-1H-indol-5-ol methiodide.
102. A compound of claim 1 which is 2-(4Hydroxy-phenyl)-3-methyl-1-4-(2 direthyl-1-yl-ethoxy)-benzyl-1H-indol-5-ol methiodide.
103. A pharnaceutical composition comprising a compound of claim 1, or a pharmaceutically acceptable salt thereof, and a pharmaceuticaly acceptable carrier or excipient.
104. A method of treating or preventing bone loss in a mammal, the method comprising administering to a mammal in need thereof an effective amount of a compound of claim 1, or a pharmaceutically acceptable salt thereof.
105. A method of treatng or preventing disease states or syndromes which are caused or associated with an estrogen deficiency in a mammal, the method comprising administering to a mammal in need thereof an effective amount of a compound of claim 1, or a pharmaceutically acceptable salt thereof.
106. A method of treating or preventing cardiovascular disease in a mammal, the method comprising administering to a mammal in need thereof an effective amount of a compound of claim 1, or a pharmaceutically acceptable salt thereof.
107. A method of treating or preventing disease in a mammal which result from proliferation or abnormal development, actions or growth of endometnal or endomemal-like tissue, the method comprising administering to a mammal in need thereof an effective amount of a compound of claim 1, or a pharmaceutically acceptable salt thereof.